./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl/chromosome-trans.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/chl/chromosome-trans.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 e7b4df25dfc6745791d4d43165d1604ab5956e28 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-8c2bbc9 [2021-10-04 18:28:50,896 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-04 18:28:50,901 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-04 18:28:50,956 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-04 18:28:50,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-04 18:28:50,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-04 18:28:50,964 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-04 18:28:50,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-04 18:28:50,973 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-04 18:28:50,979 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-04 18:28:50,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-04 18:28:50,986 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-04 18:28:50,987 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-04 18:28:50,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-04 18:28:50,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-04 18:28:51,000 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-04 18:28:51,001 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-04 18:28:51,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-04 18:28:51,006 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-04 18:28:51,016 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-04 18:28:51,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-04 18:28:51,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-04 18:28:51,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-04 18:28:51,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-04 18:28:51,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-04 18:28:51,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-04 18:28:51,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-04 18:28:51,039 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-04 18:28:51,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-04 18:28:51,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-04 18:28:51,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-04 18:28:51,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-04 18:28:51,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-04 18:28:51,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-04 18:28:51,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-04 18:28:51,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-04 18:28:51,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-04 18:28:51,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-04 18:28:51,057 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-04 18:28:51,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-04 18:28:51,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-04 18:28:51,069 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-04 18:28:51,121 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-04 18:28:51,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-04 18:28:51,122 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-04 18:28:51,123 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-04 18:28:51,126 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-04 18:28:51,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-04 18:28:51,127 INFO L138 SettingsManager]: * Use SBE=true [2021-10-04 18:28:51,127 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-04 18:28:51,128 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-04 18:28:51,128 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-04 18:28:51,129 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-04 18:28:51,129 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-04 18:28:51,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-04 18:28:51,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-04 18:28:51,130 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-04 18:28:51,130 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-04 18:28:51,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-04 18:28:51,131 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-04 18:28:51,132 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-04 18:28:51,132 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-04 18:28:51,132 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-04 18:28:51,132 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-04 18:28:51,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-04 18:28:51,133 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-04 18:28:51,133 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-04 18:28:51,133 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-04 18:28:51,134 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-04 18:28:51,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-04 18:28:51,134 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-04 18:28:51,134 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-04 18:28:51,135 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 -> e7b4df25dfc6745791d4d43165d1604ab5956e28 [2021-10-04 18:28:51,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-04 18:28:51,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-04 18:28:51,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-04 18:28:51,575 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-04 18:28:51,576 INFO L275 PluginConnector]: CDTParser initialized [2021-10-04 18:28:51,577 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl/chromosome-trans.wvr.c [2021-10-04 18:28:51,656 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f84ef0f4c/258a3b2bbece4919b4e95460a5057bd1/FLAGb264c2b74 [2021-10-04 18:28:52,260 INFO L306 CDTParser]: Found 1 translation units. [2021-10-04 18:28:52,261 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/chl/chromosome-trans.wvr.c [2021-10-04 18:28:52,261 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2021-10-04 18:28:52,262 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2021-10-04 18:28:52,271 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f84ef0f4c/258a3b2bbece4919b4e95460a5057bd1/FLAGb264c2b74 [2021-10-04 18:28:52,650 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f84ef0f4c/258a3b2bbece4919b4e95460a5057bd1 [2021-10-04 18:28:52,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-04 18:28:52,661 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-04 18:28:52,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-04 18:28:52,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-04 18:28:52,668 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-04 18:28:52,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.10 06:28:52" (1/1) ... [2021-10-04 18:28:52,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32e6bf39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:28:52, skipping insertion in model container [2021-10-04 18:28:52,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.10 06:28:52" (1/1) ... [2021-10-04 18:28:52,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-04 18:28:52,698 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-04 18:28:52,870 WARN L612 FunctionHandler]: implicit declaration of function assert [2021-10-04 18:28:52,968 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/chl/chromosome-trans.wvr.c[1565,1578] [2021-10-04 18:28:52,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-04 18:28:52,998 INFO L203 MainTranslator]: Completed pre-run [2021-10-04 18:28:53,011 WARN L612 FunctionHandler]: implicit declaration of function assert [2021-10-04 18:28:53,055 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/chl/chromosome-trans.wvr.c[1565,1578] [2021-10-04 18:28:53,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-04 18:28:53,085 INFO L208 MainTranslator]: Completed translation [2021-10-04 18:28:53,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:28:53 WrapperNode [2021-10-04 18:28:53,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-04 18:28:53,087 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-04 18:28:53,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-04 18:28:53,088 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-04 18:28:53,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:28:53" (1/1) ... [2021-10-04 18:28:53,119 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:28:53" (1/1) ... [2021-10-04 18:28:53,172 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-04 18:28:53,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-04 18:28:53,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-04 18:28:53,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-04 18:28:53,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:28:53" (1/1) ... [2021-10-04 18:28:53,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:28:53" (1/1) ... [2021-10-04 18:28:53,202 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:28:53" (1/1) ... [2021-10-04 18:28:53,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:28:53" (1/1) ... [2021-10-04 18:28:53,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:28:53" (1/1) ... [2021-10-04 18:28:53,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:28:53" (1/1) ... [2021-10-04 18:28:53,246 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:28:53" (1/1) ... [2021-10-04 18:28:53,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-04 18:28:53,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-04 18:28:53,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-04 18:28:53,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-04 18:28:53,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:28:53" (1/1) ... [2021-10-04 18:28:53,268 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-04 18:28:53,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-04 18:28:53,303 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-04 18:28:53,321 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-04 18:28:53,370 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-04 18:28:53,371 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-04 18:28:53,371 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-04 18:28:53,371 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-04 18:28:53,372 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-10-04 18:28:53,373 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-10-04 18:28:53,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-04 18:28:53,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-04 18:28:53,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-04 18:28:53,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-04 18:28:53,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-04 18:28:53,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-04 18:28:53,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-04 18:28:53,381 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-04 18:28:53,918 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-04 18:28:53,918 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-10-04 18:28:53,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 06:28:53 BoogieIcfgContainer [2021-10-04 18:28:53,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-04 18:28:53,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-04 18:28:53,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-04 18:28:53,944 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-04 18:28:53,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.10 06:28:52" (1/3) ... [2021-10-04 18:28:53,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac5b89a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 06:28:53, skipping insertion in model container [2021-10-04 18:28:53,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:28:53" (2/3) ... [2021-10-04 18:28:53,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac5b89a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 06:28:53, skipping insertion in model container [2021-10-04 18:28:53,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 06:28:53" (3/3) ... [2021-10-04 18:28:53,954 INFO L111 eAbstractionObserver]: Analyzing ICFG chromosome-trans.wvr.c [2021-10-04 18:28:53,961 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-04 18:28:53,962 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-04 18:28:53,962 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-04 18:28:53,962 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-04 18:28:54,038 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,041 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,042 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,042 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,043 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,043 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,043 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,044 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,044 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,044 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,045 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,045 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,046 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,046 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,047 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,047 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,047 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,048 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,048 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,049 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,049 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,050 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,050 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,050 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,051 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,052 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,052 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,053 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,054 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,054 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,055 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,055 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,056 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,056 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,056 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,057 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,057 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,057 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,057 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,058 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,058 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,058 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,059 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,059 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,061 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,061 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,062 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,062 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,063 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,064 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,065 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,065 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,065 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,065 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,066 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,066 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,067 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,067 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,067 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,068 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,068 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,069 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,070 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,070 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,070 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,073 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,074 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,075 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,076 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,076 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,076 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,076 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,077 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,078 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,078 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,078 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,078 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,080 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,081 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,081 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,081 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,082 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,082 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,082 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,083 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,084 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,087 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,087 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,089 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,090 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,090 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,091 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,092 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,092 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,092 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,098 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,098 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,099 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,099 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,099 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,099 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,100 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,100 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,100 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,100 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,100 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,101 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,101 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,104 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,105 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,105 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,105 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,106 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,106 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,106 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,107 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,107 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,107 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,107 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,108 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,108 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,108 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,109 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,109 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,109 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,109 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,110 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,110 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,110 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,111 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,112 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,112 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,124 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,125 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,125 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,125 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,126 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,126 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,126 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,126 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,134 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,134 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,134 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,135 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,135 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,135 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,135 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,136 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,139 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,140 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,140 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,140 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,141 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,141 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,142 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,142 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:28:54,164 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-10-04 18:28:54,235 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-04 18:28:54,247 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-04 18:28:54,248 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-10-04 18:28:54,288 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-04 18:28:54,310 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 212 transitions, 448 flow [2021-10-04 18:28:54,314 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 212 transitions, 448 flow [2021-10-04 18:28:54,317 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 200 places, 212 transitions, 448 flow [2021-10-04 18:28:54,441 INFO L129 PetriNetUnfolder]: 22/209 cut-off events. [2021-10-04 18:28:54,441 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-10-04 18:28:54,451 INFO L84 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 209 events. 22/209 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 227 event pairs, 0 based on Foata normal form. 0/186 useless extension candidates. Maximal degree in co-relation 165. Up to 3 conditions per place. [2021-10-04 18:28:54,458 INFO L116 LiptonReduction]: Number of co-enabled transitions 4272 [2021-10-04 18:29:01,316 INFO L131 LiptonReduction]: Checked pairs total: 5981 [2021-10-04 18:29:01,316 INFO L133 LiptonReduction]: Total number of compositions: 208 [2021-10-04 18:29:01,327 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 40 transitions, 104 flow [2021-10-04 18:29:01,369 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 311 states, 310 states have (on average 3.7870967741935484) internal successors, (1174), 310 states have internal predecessors, (1174), 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-04 18:29:01,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 311 states, 310 states have (on average 3.7870967741935484) internal successors, (1174), 310 states have internal predecessors, (1174), 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-04 18:29:01,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-04 18:29:01,389 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:01,390 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] [2021-10-04 18:29:01,391 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-04 18:29:01,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:01,397 INFO L82 PathProgramCache]: Analyzing trace with hash 424765599, now seen corresponding path program 1 times [2021-10-04 18:29:01,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:01,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697836924] [2021-10-04 18:29:01,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:01,410 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:01,628 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-04 18:29:01,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:01,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697836924] [2021-10-04 18:29:01,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697836924] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:29:01,631 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:29:01,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-04 18:29:01,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388325754] [2021-10-04 18:29:01,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-04 18:29:01,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:01,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-04 18:29:01,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-04 18:29:01,659 INFO L87 Difference]: Start difference. First operand has 311 states, 310 states have (on average 3.7870967741935484) internal successors, (1174), 310 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:29:01,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:01,710 INFO L93 Difference]: Finished difference Result 314 states and 1177 transitions. [2021-10-04 18:29:01,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-04 18:29:01,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-04 18:29:01,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:01,731 INFO L225 Difference]: With dead ends: 314 [2021-10-04 18:29:01,732 INFO L226 Difference]: Without dead ends: 314 [2021-10-04 18:29:01,734 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-04 18:29:01,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-10-04 18:29:01,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2021-10-04 18:29:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 3.7603833865814695) internal successors, (1177), 313 states have internal predecessors, (1177), 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-04 18:29:01,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 1177 transitions. [2021-10-04 18:29:01,821 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 1177 transitions. Word has length 22 [2021-10-04 18:29:01,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:01,822 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 1177 transitions. [2021-10-04 18:29:01,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:29:01,822 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 1177 transitions. [2021-10-04 18:29:01,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-04 18:29:01,828 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:01,828 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] [2021-10-04 18:29:01,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-04 18:29:01,829 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-04 18:29:01,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:01,829 INFO L82 PathProgramCache]: Analyzing trace with hash 115213769, now seen corresponding path program 1 times [2021-10-04 18:29:01,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:01,830 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510980023] [2021-10-04 18:29:01,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:01,831 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:01,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-04 18:29:01,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:01,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510980023] [2021-10-04 18:29:01,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510980023] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:01,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975032677] [2021-10-04 18:29:01,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:01,952 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-04 18:29:01,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-04 18:29:01,954 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-04 18:29:01,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-04 18:29:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:02,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-04 18:29:02,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-04 18:29:02,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-04 18:29:02,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975032677] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:02,211 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-04 18:29:02,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2021-10-04 18:29:02,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231978134] [2021-10-04 18:29:02,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-04 18:29:02,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:02,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-04 18:29:02,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-04 18:29:02,215 INFO L87 Difference]: Start difference. First operand 314 states and 1177 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:29:02,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:02,256 INFO L93 Difference]: Finished difference Result 317 states and 1180 transitions. [2021-10-04 18:29:02,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-04 18:29:02,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-04 18:29:02,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:02,267 INFO L225 Difference]: With dead ends: 317 [2021-10-04 18:29:02,268 INFO L226 Difference]: Without dead ends: 317 [2021-10-04 18:29:02,269 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.0ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-04 18:29:02,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-10-04 18:29:02,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2021-10-04 18:29:02,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 3.7341772151898733) internal successors, (1180), 316 states have internal predecessors, (1180), 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-04 18:29:02,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 1180 transitions. [2021-10-04 18:29:02,333 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 1180 transitions. Word has length 25 [2021-10-04 18:29:02,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:02,334 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 1180 transitions. [2021-10-04 18:29:02,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:29:02,334 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 1180 transitions. [2021-10-04 18:29:02,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-04 18:29:02,343 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:02,343 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:29:02,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-10-04 18:29:02,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-04 18:29:02,559 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-04 18:29:02,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:02,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1133597855, now seen corresponding path program 2 times [2021-10-04 18:29:02,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:02,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924441889] [2021-10-04 18:29:02,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:02,561 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:02,739 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-04 18:29:02,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:02,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924441889] [2021-10-04 18:29:02,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924441889] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:02,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956699198] [2021-10-04 18:29:02,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-04 18:29:02,741 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-04 18:29:02,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-04 18:29:02,747 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-04 18:29:02,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-04 18:29:02,877 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-04 18:29:02,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-04 18:29:02,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-04 18:29:02,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-04 18:29:02,976 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-04 18:29:02,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956699198] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:29:02,976 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-04 18:29:02,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2021-10-04 18:29:02,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652277460] [2021-10-04 18:29:02,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-04 18:29:02,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:02,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-04 18:29:02,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-04 18:29:02,981 INFO L87 Difference]: Start difference. First operand 317 states and 1180 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:29:03,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:03,022 INFO L93 Difference]: Finished difference Result 518 states and 1879 transitions. [2021-10-04 18:29:03,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-04 18:29:03,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-10-04 18:29:03,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:03,036 INFO L225 Difference]: With dead ends: 518 [2021-10-04 18:29:03,037 INFO L226 Difference]: Without dead ends: 505 [2021-10-04 18:29:03,037 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 16.8ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-04 18:29:03,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-10-04 18:29:03,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 429. [2021-10-04 18:29:03,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 3.5654205607476634) internal successors, (1526), 428 states have internal predecessors, (1526), 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-04 18:29:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1526 transitions. [2021-10-04 18:29:03,089 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1526 transitions. Word has length 28 [2021-10-04 18:29:03,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:03,090 INFO L470 AbstractCegarLoop]: Abstraction has 429 states and 1526 transitions. [2021-10-04 18:29:03,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:29:03,091 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1526 transitions. [2021-10-04 18:29:03,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-04 18:29:03,096 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:03,096 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 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-04 18:29:03,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-10-04 18:29:03,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-04 18:29:03,312 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-04 18:29:03,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:03,313 INFO L82 PathProgramCache]: Analyzing trace with hash 2065092519, now seen corresponding path program 1 times [2021-10-04 18:29:03,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:03,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098208644] [2021-10-04 18:29:03,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:03,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:03,512 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-04 18:29:03,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:03,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098208644] [2021-10-04 18:29:03,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098208644] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:03,514 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422580518] [2021-10-04 18:29:03,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:03,514 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-04 18:29:03,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-04 18:29:03,516 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-04 18:29:03,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-04 18:29:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:03,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-04 18:29:03,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-04 18:29:03,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-04 18:29:03,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422580518] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:03,776 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-04 18:29:03,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2021-10-04 18:29:03,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567716755] [2021-10-04 18:29:03,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-04 18:29:03,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:03,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-04 18:29:03,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-10-04 18:29:03,778 INFO L87 Difference]: Start difference. First operand 429 states and 1526 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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-04 18:29:03,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:03,886 INFO L93 Difference]: Finished difference Result 1024 states and 3519 transitions. [2021-10-04 18:29:03,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-04 18:29:03,887 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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 30 [2021-10-04 18:29:03,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:03,897 INFO L225 Difference]: With dead ends: 1024 [2021-10-04 18:29:03,897 INFO L226 Difference]: Without dead ends: 1024 [2021-10-04 18:29:03,898 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 49.6ms TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-10-04 18:29:03,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2021-10-04 18:29:03,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 636. [2021-10-04 18:29:03,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 3.809448818897638) internal successors, (2419), 635 states have internal predecessors, (2419), 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-04 18:29:03,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 2419 transitions. [2021-10-04 18:29:03,956 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 2419 transitions. Word has length 30 [2021-10-04 18:29:03,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:03,956 INFO L470 AbstractCegarLoop]: Abstraction has 636 states and 2419 transitions. [2021-10-04 18:29:03,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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-04 18:29:03,957 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 2419 transitions. [2021-10-04 18:29:03,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-04 18:29:03,963 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:03,963 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:29:04,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-04 18:29:04,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-04 18:29:04,177 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-04 18:29:04,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:04,179 INFO L82 PathProgramCache]: Analyzing trace with hash -625470171, now seen corresponding path program 2 times [2021-10-04 18:29:04,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:04,179 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674433993] [2021-10-04 18:29:04,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:04,180 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:04,274 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-04 18:29:04,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:04,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674433993] [2021-10-04 18:29:04,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674433993] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:29:04,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:29:04,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-04 18:29:04,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031280861] [2021-10-04 18:29:04,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-04 18:29:04,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:04,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-04 18:29:04,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-04 18:29:04,280 INFO L87 Difference]: Start difference. First operand 636 states and 2419 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:29:04,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:04,350 INFO L93 Difference]: Finished difference Result 970 states and 3593 transitions. [2021-10-04 18:29:04,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-04 18:29:04,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-10-04 18:29:04,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:04,361 INFO L225 Difference]: With dead ends: 970 [2021-10-04 18:29:04,361 INFO L226 Difference]: Without dead ends: 970 [2021-10-04 18:29:04,362 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-04 18:29:04,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2021-10-04 18:29:04,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 666. [2021-10-04 18:29:04,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 665 states have (on average 3.8601503759398494) internal successors, (2567), 665 states have internal predecessors, (2567), 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-04 18:29:04,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 2567 transitions. [2021-10-04 18:29:04,397 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 2567 transitions. Word has length 35 [2021-10-04 18:29:04,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:04,398 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 2567 transitions. [2021-10-04 18:29:04,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:29:04,398 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 2567 transitions. [2021-10-04 18:29:04,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-04 18:29:04,402 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:04,402 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 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-04 18:29:04,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-04 18:29:04,403 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-04 18:29:04,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:04,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1389548488, now seen corresponding path program 1 times [2021-10-04 18:29:04,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:04,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719307609] [2021-10-04 18:29:04,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:04,404 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-10-04 18:29:04,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:04,473 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719307609] [2021-10-04 18:29:04,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719307609] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:29:04,475 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:29:04,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-04 18:29:04,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327792077] [2021-10-04 18:29:04,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-04 18:29:04,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:04,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-04 18:29:04,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-04 18:29:04,477 INFO L87 Difference]: Start difference. First operand 666 states and 2567 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-04 18:29:04,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:04,522 INFO L93 Difference]: Finished difference Result 836 states and 2975 transitions. [2021-10-04 18:29:04,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-04 18:29:04,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 35 [2021-10-04 18:29:04,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:04,531 INFO L225 Difference]: With dead ends: 836 [2021-10-04 18:29:04,531 INFO L226 Difference]: Without dead ends: 816 [2021-10-04 18:29:04,532 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-04 18:29:04,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2021-10-04 18:29:04,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 696. [2021-10-04 18:29:04,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 695 states have (on average 3.7482014388489207) internal successors, (2605), 695 states have internal predecessors, (2605), 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-04 18:29:04,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 2605 transitions. [2021-10-04 18:29:04,566 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 2605 transitions. Word has length 35 [2021-10-04 18:29:04,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:04,566 INFO L470 AbstractCegarLoop]: Abstraction has 696 states and 2605 transitions. [2021-10-04 18:29:04,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-04 18:29:04,567 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 2605 transitions. [2021-10-04 18:29:04,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-04 18:29:04,570 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:04,570 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:29:04,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-04 18:29:04,571 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-04 18:29:04,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:04,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1769023479, now seen corresponding path program 3 times [2021-10-04 18:29:04,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:04,572 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887340116] [2021-10-04 18:29:04,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:04,572 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-04 18:29:04,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:04,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887340116] [2021-10-04 18:29:04,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887340116] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:29:04,649 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:29:04,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-04 18:29:04,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640199020] [2021-10-04 18:29:04,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-04 18:29:04,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:04,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-04 18:29:04,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-04 18:29:04,654 INFO L87 Difference]: Start difference. First operand 696 states and 2605 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:29:04,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:04,716 INFO L93 Difference]: Finished difference Result 1226 states and 4517 transitions. [2021-10-04 18:29:04,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-04 18:29:04,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-10-04 18:29:04,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:04,730 INFO L225 Difference]: With dead ends: 1226 [2021-10-04 18:29:04,731 INFO L226 Difference]: Without dead ends: 1226 [2021-10-04 18:29:04,731 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-04 18:29:04,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2021-10-04 18:29:04,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 706. [2021-10-04 18:29:04,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 705 states have (on average 3.7602836879432626) internal successors, (2651), 705 states have internal predecessors, (2651), 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-04 18:29:04,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 2651 transitions. [2021-10-04 18:29:04,777 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 2651 transitions. Word has length 35 [2021-10-04 18:29:04,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:04,778 INFO L470 AbstractCegarLoop]: Abstraction has 706 states and 2651 transitions. [2021-10-04 18:29:04,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:29:04,779 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 2651 transitions. [2021-10-04 18:29:04,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-04 18:29:04,782 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:04,782 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:29:04,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-04 18:29:04,783 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-04 18:29:04,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:04,784 INFO L82 PathProgramCache]: Analyzing trace with hash -218085457, now seen corresponding path program 4 times [2021-10-04 18:29:04,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:04,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751337564] [2021-10-04 18:29:04,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:04,785 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:04,840 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-04 18:29:04,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:04,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751337564] [2021-10-04 18:29:04,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751337564] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:29:04,841 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:29:04,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-04 18:29:04,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060471245] [2021-10-04 18:29:04,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-04 18:29:04,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:04,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-04 18:29:04,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-04 18:29:04,844 INFO L87 Difference]: Start difference. First operand 706 states and 2651 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:29:04,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:04,884 INFO L93 Difference]: Finished difference Result 1146 states and 4187 transitions. [2021-10-04 18:29:04,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-04 18:29:04,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-10-04 18:29:04,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:04,896 INFO L225 Difference]: With dead ends: 1146 [2021-10-04 18:29:04,897 INFO L226 Difference]: Without dead ends: 1114 [2021-10-04 18:29:04,897 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-04 18:29:04,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2021-10-04 18:29:04,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 706. [2021-10-04 18:29:04,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 705 states have (on average 3.720567375886525) internal successors, (2623), 705 states have internal predecessors, (2623), 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-04 18:29:04,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 2623 transitions. [2021-10-04 18:29:04,937 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 2623 transitions. Word has length 35 [2021-10-04 18:29:04,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:04,937 INFO L470 AbstractCegarLoop]: Abstraction has 706 states and 2623 transitions. [2021-10-04 18:29:04,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-04 18:29:04,938 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 2623 transitions. [2021-10-04 18:29:04,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-04 18:29:04,941 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:04,942 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 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-04 18:29:04,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-04 18:29:04,942 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-04 18:29:04,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:04,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1595846540, now seen corresponding path program 2 times [2021-10-04 18:29:04,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:04,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268153493] [2021-10-04 18:29:04,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:04,944 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:05,002 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-10-04 18:29:05,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:05,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268153493] [2021-10-04 18:29:05,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268153493] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:29:05,004 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:29:05,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-04 18:29:05,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477559939] [2021-10-04 18:29:05,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-04 18:29:05,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:05,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-04 18:29:05,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-04 18:29:05,006 INFO L87 Difference]: Start difference. First operand 706 states and 2623 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-04 18:29:05,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:05,051 INFO L93 Difference]: Finished difference Result 844 states and 3081 transitions. [2021-10-04 18:29:05,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-04 18:29:05,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 35 [2021-10-04 18:29:05,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:05,060 INFO L225 Difference]: With dead ends: 844 [2021-10-04 18:29:05,060 INFO L226 Difference]: Without dead ends: 844 [2021-10-04 18:29:05,061 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-04 18:29:05,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2021-10-04 18:29:05,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 594. [2021-10-04 18:29:05,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 593 states have (on average 3.752107925801012) internal successors, (2225), 593 states have internal predecessors, (2225), 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-04 18:29:05,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 2225 transitions. [2021-10-04 18:29:05,091 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 2225 transitions. Word has length 35 [2021-10-04 18:29:05,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:05,091 INFO L470 AbstractCegarLoop]: Abstraction has 594 states and 2225 transitions. [2021-10-04 18:29:05,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-04 18:29:05,092 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 2225 transitions. [2021-10-04 18:29:05,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-04 18:29:05,095 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:05,095 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 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-04 18:29:05,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-04 18:29:05,096 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-04 18:29:05,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:05,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1937370948, now seen corresponding path program 1 times [2021-10-04 18:29:05,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:05,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62256287] [2021-10-04 18:29:05,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:05,097 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:05,174 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-10-04 18:29:05,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:05,174 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62256287] [2021-10-04 18:29:05,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62256287] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:05,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060179296] [2021-10-04 18:29:05,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:05,175 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-04 18:29:05,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-04 18:29:05,177 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-04 18:29:05,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-04 18:29:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:05,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-04 18:29:05,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-04 18:29:05,429 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-04 18:29:05,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060179296] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:05,430 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-04 18:29:05,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-10-04 18:29:05,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033584160] [2021-10-04 18:29:05,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-04 18:29:05,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:05,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-04 18:29:05,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:29:05,432 INFO L87 Difference]: Start difference. First operand 594 states and 2225 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 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-04 18:29:05,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:05,586 INFO L93 Difference]: Finished difference Result 1151 states and 4290 transitions. [2021-10-04 18:29:05,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-04 18:29:05,587 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 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 36 [2021-10-04 18:29:05,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:05,599 INFO L225 Difference]: With dead ends: 1151 [2021-10-04 18:29:05,599 INFO L226 Difference]: Without dead ends: 1151 [2021-10-04 18:29:05,599 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 81.1ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:29:05,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2021-10-04 18:29:05,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 787. [2021-10-04 18:29:05,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 3.8702290076335877) internal successors, (3042), 786 states have internal predecessors, (3042), 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-04 18:29:05,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3042 transitions. [2021-10-04 18:29:05,658 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3042 transitions. Word has length 36 [2021-10-04 18:29:05,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:05,659 INFO L470 AbstractCegarLoop]: Abstraction has 787 states and 3042 transitions. [2021-10-04 18:29:05,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 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-04 18:29:05,660 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3042 transitions. [2021-10-04 18:29:05,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-04 18:29:05,664 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:05,665 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 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-04 18:29:05,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-04 18:29:05,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-10-04 18:29:05,878 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-04 18:29:05,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:05,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1989376858, now seen corresponding path program 2 times [2021-10-04 18:29:05,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:05,880 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692235291] [2021-10-04 18:29:05,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:05,881 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:05,958 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-10-04 18:29:05,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:05,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692235291] [2021-10-04 18:29:05,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692235291] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:05,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737287994] [2021-10-04 18:29:05,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-04 18:29:05,960 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-04 18:29:05,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-04 18:29:05,961 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-04 18:29:05,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-04 18:29:06,077 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-04 18:29:06,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-04 18:29:06,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-04 18:29:06,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-04 18:29:06,171 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-10-04 18:29:06,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737287994] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:29:06,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-04 18:29:06,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2021-10-04 18:29:06,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883404028] [2021-10-04 18:29:06,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-04 18:29:06,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:06,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-04 18:29:06,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-04 18:29:06,174 INFO L87 Difference]: Start difference. First operand 787 states and 3042 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-04 18:29:06,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:06,220 INFO L93 Difference]: Finished difference Result 1711 states and 6384 transitions. [2021-10-04 18:29:06,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-04 18:29:06,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 39 [2021-10-04 18:29:06,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:06,237 INFO L225 Difference]: With dead ends: 1711 [2021-10-04 18:29:06,237 INFO L226 Difference]: Without dead ends: 1679 [2021-10-04 18:29:06,238 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 27.6ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-04 18:29:06,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2021-10-04 18:29:06,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 805. [2021-10-04 18:29:06,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 804 states have (on average 3.861940298507463) internal successors, (3105), 804 states have internal predecessors, (3105), 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-04 18:29:06,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3105 transitions. [2021-10-04 18:29:06,283 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3105 transitions. Word has length 39 [2021-10-04 18:29:06,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:06,284 INFO L470 AbstractCegarLoop]: Abstraction has 805 states and 3105 transitions. [2021-10-04 18:29:06,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-04 18:29:06,284 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3105 transitions. [2021-10-04 18:29:06,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-04 18:29:06,288 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:06,288 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 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-04 18:29:06,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-04 18:29:06,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-04 18:29:06,502 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-04 18:29:06,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:06,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1576805362, now seen corresponding path program 3 times [2021-10-04 18:29:06,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:06,504 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378051269] [2021-10-04 18:29:06,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:06,504 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:06,602 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-10-04 18:29:06,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:06,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378051269] [2021-10-04 18:29:06,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378051269] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:06,604 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288521139] [2021-10-04 18:29:06,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-04 18:29:06,604 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-04 18:29:06,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-04 18:29:06,606 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-04 18:29:06,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-04 18:29:06,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-10-04 18:29:06,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-04 18:29:06,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-04 18:29:06,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-04 18:29:06,913 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-10-04 18:29:06,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288521139] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:06,914 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-04 18:29:06,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-10-04 18:29:06,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168588944] [2021-10-04 18:29:06,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-04 18:29:06,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:06,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-04 18:29:06,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-04 18:29:06,917 INFO L87 Difference]: Start difference. First operand 805 states and 3105 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-04 18:29:06,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:06,984 INFO L93 Difference]: Finished difference Result 1649 states and 6183 transitions. [2021-10-04 18:29:06,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-04 18:29:06,985 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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 39 [2021-10-04 18:29:06,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:07,002 INFO L225 Difference]: With dead ends: 1649 [2021-10-04 18:29:07,003 INFO L226 Difference]: Without dead ends: 1649 [2021-10-04 18:29:07,003 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 27.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-04 18:29:07,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2021-10-04 18:29:07,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 917. [2021-10-04 18:29:07,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 916 states have (on average 3.8482532751091703) internal successors, (3525), 916 states have internal predecessors, (3525), 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-04 18:29:07,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 3525 transitions. [2021-10-04 18:29:07,057 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 3525 transitions. Word has length 39 [2021-10-04 18:29:07,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:07,057 INFO L470 AbstractCegarLoop]: Abstraction has 917 states and 3525 transitions. [2021-10-04 18:29:07,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-04 18:29:07,058 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 3525 transitions. [2021-10-04 18:29:07,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-04 18:29:07,062 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:07,062 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 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-04 18:29:07,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-10-04 18:29:07,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-10-04 18:29:07,279 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-04 18:29:07,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:07,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1471551788, now seen corresponding path program 1 times [2021-10-04 18:29:07,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:07,281 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467858949] [2021-10-04 18:29:07,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:07,281 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:07,359 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-10-04 18:29:07,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:07,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467858949] [2021-10-04 18:29:07,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467858949] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:07,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829745395] [2021-10-04 18:29:07,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:07,361 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-04 18:29:07,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-04 18:29:07,362 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-04 18:29:07,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-04 18:29:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:07,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-04 18:29:07,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-04 18:29:07,675 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-10-04 18:29:07,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829745395] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:07,675 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-04 18:29:07,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2021-10-04 18:29:07,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134101081] [2021-10-04 18:29:07,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:29:07,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:07,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:29:07,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:29:07,677 INFO L87 Difference]: Start difference. First operand 917 states and 3525 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 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-04 18:29:07,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:07,734 INFO L93 Difference]: Finished difference Result 920 states and 3528 transitions. [2021-10-04 18:29:07,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-04 18:29:07,735 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 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 41 [2021-10-04 18:29:07,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:07,744 INFO L225 Difference]: With dead ends: 920 [2021-10-04 18:29:07,744 INFO L226 Difference]: Without dead ends: 920 [2021-10-04 18:29:07,744 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 73.3ms TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:29:07,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2021-10-04 18:29:07,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 920. [2021-10-04 18:29:07,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 919 states have (on average 3.838955386289445) internal successors, (3528), 919 states have internal predecessors, (3528), 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-04 18:29:07,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 3528 transitions. [2021-10-04 18:29:07,782 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 3528 transitions. Word has length 41 [2021-10-04 18:29:07,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:07,782 INFO L470 AbstractCegarLoop]: Abstraction has 920 states and 3528 transitions. [2021-10-04 18:29:07,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 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-04 18:29:07,783 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 3528 transitions. [2021-10-04 18:29:07,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-04 18:29:07,787 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:07,787 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 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-04 18:29:07,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-10-04 18:29:08,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-10-04 18:29:08,002 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-04 18:29:08,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:08,003 INFO L82 PathProgramCache]: Analyzing trace with hash -400303166, now seen corresponding path program 2 times [2021-10-04 18:29:08,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:08,003 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720397835] [2021-10-04 18:29:08,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:08,004 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:08,088 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-04 18:29:08,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:08,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720397835] [2021-10-04 18:29:08,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720397835] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:08,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969317030] [2021-10-04 18:29:08,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-04 18:29:08,089 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-04 18:29:08,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-04 18:29:08,090 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-04 18:29:08,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-10-04 18:29:08,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-04 18:29:08,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-04 18:29:08,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-04 18:29:08,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-04 18:29:08,453 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-04 18:29:08,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969317030] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:08,453 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-04 18:29:08,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2021-10-04 18:29:08,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617508988] [2021-10-04 18:29:08,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-04 18:29:08,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:08,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-04 18:29:08,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-04 18:29:08,455 INFO L87 Difference]: Start difference. First operand 920 states and 3528 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-04 18:29:08,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:08,522 INFO L93 Difference]: Finished difference Result 1762 states and 6396 transitions. [2021-10-04 18:29:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-04 18:29:08,523 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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 44 [2021-10-04 18:29:08,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:08,540 INFO L225 Difference]: With dead ends: 1762 [2021-10-04 18:29:08,540 INFO L226 Difference]: Without dead ends: 1762 [2021-10-04 18:29:08,541 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 32.9ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-04 18:29:08,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2021-10-04 18:29:08,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1148. [2021-10-04 18:29:08,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1147 states have (on average 3.909328683522232) internal successors, (4484), 1147 states have internal predecessors, (4484), 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-04 18:29:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 4484 transitions. [2021-10-04 18:29:08,594 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 4484 transitions. Word has length 44 [2021-10-04 18:29:08,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:08,595 INFO L470 AbstractCegarLoop]: Abstraction has 1148 states and 4484 transitions. [2021-10-04 18:29:08,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-04 18:29:08,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 4484 transitions. [2021-10-04 18:29:08,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-04 18:29:08,600 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:08,601 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 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-04 18:29:08,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-10-04 18:29:08,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-10-04 18:29:08,817 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-04 18:29:08,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:08,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1922723539, now seen corresponding path program 4 times [2021-10-04 18:29:08,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:08,819 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844467614] [2021-10-04 18:29:08,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:08,819 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-04 18:29:08,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:08,905 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844467614] [2021-10-04 18:29:08,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844467614] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:08,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368164777] [2021-10-04 18:29:08,906 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-04 18:29:08,906 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-04 18:29:08,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-04 18:29:08,907 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-04 18:29:08,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-10-04 18:29:09,078 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-04 18:29:09,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-04 18:29:09,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-04 18:29:09,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-04 18:29:09,266 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-04 18:29:09,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368164777] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:09,266 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-04 18:29:09,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-10-04 18:29:09,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257560276] [2021-10-04 18:29:09,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-04 18:29:09,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:09,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-04 18:29:09,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-10-04 18:29:09,268 INFO L87 Difference]: Start difference. First operand 1148 states and 4484 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-04 18:29:09,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:09,338 INFO L93 Difference]: Finished difference Result 2276 states and 8762 transitions. [2021-10-04 18:29:09,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-04 18:29:09,339 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 46 [2021-10-04 18:29:09,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:09,352 INFO L225 Difference]: With dead ends: 2276 [2021-10-04 18:29:09,353 INFO L226 Difference]: Without dead ends: 2276 [2021-10-04 18:29:09,353 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 31.4ms TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-10-04 18:29:09,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2276 states. [2021-10-04 18:29:09,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2276 to 1428. [2021-10-04 18:29:09,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1427 states have (on average 3.9747722494744218) internal successors, (5672), 1427 states have internal predecessors, (5672), 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-04 18:29:09,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 5672 transitions. [2021-10-04 18:29:09,419 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 5672 transitions. Word has length 46 [2021-10-04 18:29:09,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:09,419 INFO L470 AbstractCegarLoop]: Abstraction has 1428 states and 5672 transitions. [2021-10-04 18:29:09,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-04 18:29:09,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 5672 transitions. [2021-10-04 18:29:09,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-04 18:29:09,425 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:09,426 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 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-04 18:29:09,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-10-04 18:29:09,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-04 18:29:09,640 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-04 18:29:09,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:09,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1187853294, now seen corresponding path program 3 times [2021-10-04 18:29:09,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:09,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180603804] [2021-10-04 18:29:09,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:09,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-04 18:29:09,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:09,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180603804] [2021-10-04 18:29:09,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180603804] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:09,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939644859] [2021-10-04 18:29:09,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-04 18:29:09,736 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-04 18:29:09,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-04 18:29:09,737 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-04 18:29:09,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-10-04 18:29:10,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-10-04 18:29:10,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-04 18:29:10,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-04 18:29:10,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-04 18:29:10,295 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-04 18:29:10,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939644859] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:10,296 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-04 18:29:10,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-10-04 18:29:10,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151999947] [2021-10-04 18:29:10,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-04 18:29:10,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:10,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-04 18:29:10,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:29:10,297 INFO L87 Difference]: Start difference. First operand 1428 states and 5672 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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-04 18:29:10,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:10,361 INFO L93 Difference]: Finished difference Result 2666 states and 9793 transitions. [2021-10-04 18:29:10,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-04 18:29:10,362 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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 46 [2021-10-04 18:29:10,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:10,375 INFO L225 Difference]: With dead ends: 2666 [2021-10-04 18:29:10,375 INFO L226 Difference]: Without dead ends: 2666 [2021-10-04 18:29:10,375 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 41.6ms TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:29:10,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2021-10-04 18:29:10,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 1736. [2021-10-04 18:29:10,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1736 states, 1735 states have (on average 4.020749279538905) internal successors, (6976), 1735 states have internal predecessors, (6976), 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-04 18:29:10,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 6976 transitions. [2021-10-04 18:29:10,451 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 6976 transitions. Word has length 46 [2021-10-04 18:29:10,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:10,452 INFO L470 AbstractCegarLoop]: Abstraction has 1736 states and 6976 transitions. [2021-10-04 18:29:10,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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-04 18:29:10,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 6976 transitions. [2021-10-04 18:29:10,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-04 18:29:10,459 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:10,459 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 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-04 18:29:10,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-10-04 18:29:10,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-10-04 18:29:10,672 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-04 18:29:10,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:10,672 INFO L82 PathProgramCache]: Analyzing trace with hash 398743461, now seen corresponding path program 5 times [2021-10-04 18:29:10,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:10,673 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484200604] [2021-10-04 18:29:10,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:10,674 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:10,717 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-04 18:29:10,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:10,717 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484200604] [2021-10-04 18:29:10,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484200604] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:29:10,717 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:29:10,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-04 18:29:10,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143969260] [2021-10-04 18:29:10,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-04 18:29:10,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:10,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-04 18:29:10,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-04 18:29:10,719 INFO L87 Difference]: Start difference. First operand 1736 states and 6976 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-04 18:29:10,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:10,755 INFO L93 Difference]: Finished difference Result 2384 states and 9117 transitions. [2021-10-04 18:29:10,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-04 18:29:10,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 46 [2021-10-04 18:29:10,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:10,791 INFO L225 Difference]: With dead ends: 2384 [2021-10-04 18:29:10,791 INFO L226 Difference]: Without dead ends: 2384 [2021-10-04 18:29:10,792 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-04 18:29:10,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2021-10-04 18:29:10,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 2136. [2021-10-04 18:29:10,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2136 states, 2135 states have (on average 3.9747072599531617) internal successors, (8486), 2135 states have internal predecessors, (8486), 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-04 18:29:10,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 8486 transitions. [2021-10-04 18:29:10,900 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 8486 transitions. Word has length 46 [2021-10-04 18:29:10,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:10,900 INFO L470 AbstractCegarLoop]: Abstraction has 2136 states and 8486 transitions. [2021-10-04 18:29:10,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-04 18:29:10,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 8486 transitions. [2021-10-04 18:29:10,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-04 18:29:10,911 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:10,911 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 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-04 18:29:10,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-04 18:29:10,912 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-04 18:29:10,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:10,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1584993315, now seen corresponding path program 6 times [2021-10-04 18:29:10,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:10,913 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441518444] [2021-10-04 18:29:10,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:10,914 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:10,968 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-10-04 18:29:10,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:10,968 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441518444] [2021-10-04 18:29:10,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441518444] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:29:10,969 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:29:10,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-04 18:29:10,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576711393] [2021-10-04 18:29:10,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-04 18:29:10,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:10,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-04 18:29:10,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-04 18:29:10,971 INFO L87 Difference]: Start difference. First operand 2136 states and 8486 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-04 18:29:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:11,002 INFO L93 Difference]: Finished difference Result 2362 states and 9005 transitions. [2021-10-04 18:29:11,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-04 18:29:11,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 46 [2021-10-04 18:29:11,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:11,015 INFO L225 Difference]: With dead ends: 2362 [2021-10-04 18:29:11,016 INFO L226 Difference]: Without dead ends: 2306 [2021-10-04 18:29:11,016 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-04 18:29:11,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2021-10-04 18:29:11,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2136. [2021-10-04 18:29:11,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2136 states, 2135 states have (on average 3.862295081967213) internal successors, (8246), 2135 states have internal predecessors, (8246), 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-04 18:29:11,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 8246 transitions. [2021-10-04 18:29:11,136 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 8246 transitions. Word has length 46 [2021-10-04 18:29:11,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:11,137 INFO L470 AbstractCegarLoop]: Abstraction has 2136 states and 8246 transitions. [2021-10-04 18:29:11,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-04 18:29:11,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 8246 transitions. [2021-10-04 18:29:11,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-04 18:29:11,145 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:11,145 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 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-04 18:29:11,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-04 18:29:11,146 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-04 18:29:11,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:11,146 INFO L82 PathProgramCache]: Analyzing trace with hash -699285783, now seen corresponding path program 7 times [2021-10-04 18:29:11,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:11,147 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55488432] [2021-10-04 18:29:11,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:11,147 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-04 18:29:11,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:11,231 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55488432] [2021-10-04 18:29:11,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55488432] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:11,231 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539261601] [2021-10-04 18:29:11,231 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-10-04 18:29:11,232 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-04 18:29:11,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-04 18:29:11,233 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-04 18:29:11,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-10-04 18:29:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:11,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-04 18:29:11,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-04 18:29:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-04 18:29:11,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539261601] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:11,591 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-04 18:29:11,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2021-10-04 18:29:11,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906395589] [2021-10-04 18:29:11,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-04 18:29:11,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:11,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-04 18:29:11,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-04 18:29:11,593 INFO L87 Difference]: Start difference. First operand 2136 states and 8246 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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-04 18:29:11,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:11,742 INFO L93 Difference]: Finished difference Result 4238 states and 15856 transitions. [2021-10-04 18:29:11,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-04 18:29:11,743 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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 46 [2021-10-04 18:29:11,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:11,770 INFO L225 Difference]: With dead ends: 4238 [2021-10-04 18:29:11,770 INFO L226 Difference]: Without dead ends: 4238 [2021-10-04 18:29:11,771 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 32.4ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-04 18:29:11,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4238 states. [2021-10-04 18:29:11,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4238 to 2248. [2021-10-04 18:29:11,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2248 states, 2247 states have (on average 3.856697819314642) internal successors, (8666), 2247 states have internal predecessors, (8666), 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-04 18:29:11,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 8666 transitions. [2021-10-04 18:29:11,899 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 8666 transitions. Word has length 46 [2021-10-04 18:29:11,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:11,899 INFO L470 AbstractCegarLoop]: Abstraction has 2248 states and 8666 transitions. [2021-10-04 18:29:11,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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-04 18:29:11,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 8666 transitions. [2021-10-04 18:29:11,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-04 18:29:11,908 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:11,909 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 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-04 18:29:11,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-10-04 18:29:12,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-04 18:29:12,124 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-04 18:29:12,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:12,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1602146022, now seen corresponding path program 4 times [2021-10-04 18:29:12,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:12,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670994437] [2021-10-04 18:29:12,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:12,126 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:12,229 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-04 18:29:12,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:12,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670994437] [2021-10-04 18:29:12,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670994437] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:12,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740119772] [2021-10-04 18:29:12,230 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-04 18:29:12,230 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-04 18:29:12,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-04 18:29:12,231 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-04 18:29:12,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-10-04 18:29:12,451 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-04 18:29:12,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-04 18:29:12,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-04 18:29:12,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-04 18:29:12,715 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-04 18:29:12,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740119772] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:12,715 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-04 18:29:12,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-10-04 18:29:12,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414617109] [2021-10-04 18:29:12,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:29:12,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:12,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:29:12,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:29:12,717 INFO L87 Difference]: Start difference. First operand 2248 states and 8666 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 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-04 18:29:12,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:12,817 INFO L93 Difference]: Finished difference Result 3592 states and 12837 transitions. [2021-10-04 18:29:12,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-04 18:29:12,818 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 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 48 [2021-10-04 18:29:12,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:12,837 INFO L225 Difference]: With dead ends: 3592 [2021-10-04 18:29:12,837 INFO L226 Difference]: Without dead ends: 3592 [2021-10-04 18:29:12,838 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 52.5ms TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:29:12,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3592 states. [2021-10-04 18:29:12,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3592 to 2656. [2021-10-04 18:29:12,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2656 states, 2655 states have (on average 3.871939736346516) internal successors, (10280), 2655 states have internal predecessors, (10280), 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-04 18:29:13,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2656 states to 2656 states and 10280 transitions. [2021-10-04 18:29:13,019 INFO L78 Accepts]: Start accepts. Automaton has 2656 states and 10280 transitions. Word has length 48 [2021-10-04 18:29:13,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:13,019 INFO L470 AbstractCegarLoop]: Abstraction has 2656 states and 10280 transitions. [2021-10-04 18:29:13,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 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-04 18:29:13,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2656 states and 10280 transitions. [2021-10-04 18:29:13,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-04 18:29:13,031 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:13,032 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 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-04 18:29:13,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-10-04 18:29:13,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-04 18:29:13,247 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-04 18:29:13,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:13,248 INFO L82 PathProgramCache]: Analyzing trace with hash 7643534, now seen corresponding path program 8 times [2021-10-04 18:29:13,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:13,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075850894] [2021-10-04 18:29:13,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:13,250 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:13,342 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-04 18:29:13,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:13,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075850894] [2021-10-04 18:29:13,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075850894] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:13,343 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749831753] [2021-10-04 18:29:13,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-04 18:29:13,343 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-04 18:29:13,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-04 18:29:13,344 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-04 18:29:13,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-10-04 18:29:13,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-04 18:29:13,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-04 18:29:13,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-04 18:29:13,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-04 18:29:13,750 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-04 18:29:13,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749831753] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:13,753 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-04 18:29:13,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-10-04 18:29:13,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520065779] [2021-10-04 18:29:13,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-04 18:29:13,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:13,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-04 18:29:13,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-10-04 18:29:13,756 INFO L87 Difference]: Start difference. First operand 2656 states and 10280 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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-04 18:29:13,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:13,890 INFO L93 Difference]: Finished difference Result 5474 states and 20616 transitions. [2021-10-04 18:29:13,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-04 18:29:13,891 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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 50 [2021-10-04 18:29:13,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:13,920 INFO L225 Difference]: With dead ends: 5474 [2021-10-04 18:29:13,921 INFO L226 Difference]: Without dead ends: 5474 [2021-10-04 18:29:13,921 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 36.1ms TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-10-04 18:29:13,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5474 states. [2021-10-04 18:29:14,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5474 to 3296. [2021-10-04 18:29:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3296 states, 3295 states have (on average 3.882852807283763) internal successors, (12794), 3295 states have internal predecessors, (12794), 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-04 18:29:14,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3296 states to 3296 states and 12794 transitions. [2021-10-04 18:29:14,142 INFO L78 Accepts]: Start accepts. Automaton has 3296 states and 12794 transitions. Word has length 50 [2021-10-04 18:29:14,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:14,144 INFO L470 AbstractCegarLoop]: Abstraction has 3296 states and 12794 transitions. [2021-10-04 18:29:14,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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-04 18:29:14,144 INFO L276 IsEmpty]: Start isEmpty. Operand 3296 states and 12794 transitions. [2021-10-04 18:29:14,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-04 18:29:14,161 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:14,161 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 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-04 18:29:14,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-10-04 18:29:14,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-10-04 18:29:14,376 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-04 18:29:14,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:14,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1563071302, now seen corresponding path program 5 times [2021-10-04 18:29:14,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:14,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452188736] [2021-10-04 18:29:14,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:14,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:14,513 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-10-04 18:29:14,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:14,514 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452188736] [2021-10-04 18:29:14,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452188736] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:29:14,515 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:29:14,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-04 18:29:14,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033425135] [2021-10-04 18:29:14,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-04 18:29:14,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:14,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-04 18:29:14,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-04 18:29:14,517 INFO L87 Difference]: Start difference. First operand 3296 states and 12794 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-04 18:29:14,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:14,618 INFO L93 Difference]: Finished difference Result 7722 states and 28974 transitions. [2021-10-04 18:29:14,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-04 18:29:14,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 50 [2021-10-04 18:29:14,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:14,675 INFO L225 Difference]: With dead ends: 7722 [2021-10-04 18:29:14,675 INFO L226 Difference]: Without dead ends: 7722 [2021-10-04 18:29:14,675 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-04 18:29:14,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7722 states. [2021-10-04 18:29:14,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7722 to 3916. [2021-10-04 18:29:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3916 states, 3915 states have (on average 3.871264367816092) internal successors, (15156), 3915 states have internal predecessors, (15156), 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-04 18:29:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3916 states to 3916 states and 15156 transitions. [2021-10-04 18:29:14,983 INFO L78 Accepts]: Start accepts. Automaton has 3916 states and 15156 transitions. Word has length 50 [2021-10-04 18:29:14,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:14,983 INFO L470 AbstractCegarLoop]: Abstraction has 3916 states and 15156 transitions. [2021-10-04 18:29:14,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-04 18:29:14,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3916 states and 15156 transitions. [2021-10-04 18:29:14,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-04 18:29:14,997 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:14,997 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 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-04 18:29:14,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-04 18:29:14,997 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-04 18:29:14,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:14,998 INFO L82 PathProgramCache]: Analyzing trace with hash 535568112, now seen corresponding path program 6 times [2021-10-04 18:29:14,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:14,998 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534286255] [2021-10-04 18:29:14,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:14,998 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:15,096 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-10-04 18:29:15,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:15,097 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534286255] [2021-10-04 18:29:15,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534286255] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:29:15,097 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:29:15,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-04 18:29:15,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441040173] [2021-10-04 18:29:15,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-04 18:29:15,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:15,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-04 18:29:15,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-04 18:29:15,099 INFO L87 Difference]: Start difference. First operand 3916 states and 15156 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-04 18:29:15,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:15,265 INFO L93 Difference]: Finished difference Result 6396 states and 24272 transitions. [2021-10-04 18:29:15,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-04 18:29:15,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 50 [2021-10-04 18:29:15,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:15,308 INFO L225 Difference]: With dead ends: 6396 [2021-10-04 18:29:15,309 INFO L226 Difference]: Without dead ends: 6396 [2021-10-04 18:29:15,309 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-04 18:29:15,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6396 states. [2021-10-04 18:29:15,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6396 to 3916. [2021-10-04 18:29:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3916 states, 3915 states have (on average 3.871264367816092) internal successors, (15156), 3915 states have internal predecessors, (15156), 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-04 18:29:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3916 states to 3916 states and 15156 transitions. [2021-10-04 18:29:15,452 INFO L78 Accepts]: Start accepts. Automaton has 3916 states and 15156 transitions. Word has length 50 [2021-10-04 18:29:15,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:15,453 INFO L470 AbstractCegarLoop]: Abstraction has 3916 states and 15156 transitions. [2021-10-04 18:29:15,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-04 18:29:15,453 INFO L276 IsEmpty]: Start isEmpty. Operand 3916 states and 15156 transitions. [2021-10-04 18:29:15,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-04 18:29:15,467 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:15,467 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 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-04 18:29:15,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-04 18:29:15,468 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-04 18:29:15,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:15,468 INFO L82 PathProgramCache]: Analyzing trace with hash 561117693, now seen corresponding path program 1 times [2021-10-04 18:29:15,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:15,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138969836] [2021-10-04 18:29:15,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:15,469 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:15,661 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-10-04 18:29:15,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:15,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138969836] [2021-10-04 18:29:15,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138969836] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:15,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996970188] [2021-10-04 18:29:15,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:15,662 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-04 18:29:15,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-04 18:29:15,665 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-04 18:29:15,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-10-04 18:29:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:15,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-04 18:29:15,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-04 18:29:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-10-04 18:29:15,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996970188] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:29:15,997 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-04 18:29:15,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2021-10-04 18:29:15,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146469081] [2021-10-04 18:29:15,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-04 18:29:15,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:15,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-04 18:29:15,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-04 18:29:15,998 INFO L87 Difference]: Start difference. First operand 3916 states and 15156 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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-04 18:29:16,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:16,045 INFO L93 Difference]: Finished difference Result 5211 states and 19096 transitions. [2021-10-04 18:29:16,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-04 18:29:16,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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 51 [2021-10-04 18:29:16,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:16,065 INFO L225 Difference]: With dead ends: 5211 [2021-10-04 18:29:16,065 INFO L226 Difference]: Without dead ends: 3916 [2021-10-04 18:29:16,066 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-04 18:29:16,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3916 states. [2021-10-04 18:29:16,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3916 to 3916. [2021-10-04 18:29:16,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3916 states, 3915 states have (on average 3.7052362707535123) internal successors, (14506), 3915 states have internal predecessors, (14506), 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-04 18:29:16,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3916 states to 3916 states and 14506 transitions. [2021-10-04 18:29:16,237 INFO L78 Accepts]: Start accepts. Automaton has 3916 states and 14506 transitions. Word has length 51 [2021-10-04 18:29:16,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:16,238 INFO L470 AbstractCegarLoop]: Abstraction has 3916 states and 14506 transitions. [2021-10-04 18:29:16,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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-04 18:29:16,238 INFO L276 IsEmpty]: Start isEmpty. Operand 3916 states and 14506 transitions. [2021-10-04 18:29:16,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-04 18:29:16,254 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:16,254 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 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-04 18:29:16,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-10-04 18:29:16,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-04 18:29:16,470 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-04 18:29:16,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:16,471 INFO L82 PathProgramCache]: Analyzing trace with hash -980903449, now seen corresponding path program 1 times [2021-10-04 18:29:16,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:16,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614943475] [2021-10-04 18:29:16,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:16,473 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:16,552 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-10-04 18:29:16,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:16,552 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614943475] [2021-10-04 18:29:16,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614943475] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:16,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492983786] [2021-10-04 18:29:16,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:16,553 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-04 18:29:16,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-04 18:29:16,555 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-04 18:29:16,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-10-04 18:29:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:16,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-04 18:29:16,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-04 18:29:16,962 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-10-04 18:29:16,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492983786] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:16,963 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-04 18:29:16,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-10-04 18:29:16,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273547393] [2021-10-04 18:29:16,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-04 18:29:16,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:16,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-04 18:29:16,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-04 18:29:16,966 INFO L87 Difference]: Start difference. First operand 3916 states and 14506 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 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-04 18:29:17,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:17,098 INFO L93 Difference]: Finished difference Result 6486 states and 24287 transitions. [2021-10-04 18:29:17,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-04 18:29:17,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 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 52 [2021-10-04 18:29:17,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:17,147 INFO L225 Difference]: With dead ends: 6486 [2021-10-04 18:29:17,147 INFO L226 Difference]: Without dead ends: 6486 [2021-10-04 18:29:17,148 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 29.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-04 18:29:17,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6486 states. [2021-10-04 18:29:17,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6486 to 5216. [2021-10-04 18:29:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5216 states, 5215 states have (on average 3.7300095877277086) internal successors, (19452), 5215 states have internal predecessors, (19452), 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-04 18:29:17,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5216 states to 5216 states and 19452 transitions. [2021-10-04 18:29:17,480 INFO L78 Accepts]: Start accepts. Automaton has 5216 states and 19452 transitions. Word has length 52 [2021-10-04 18:29:17,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:17,481 INFO L470 AbstractCegarLoop]: Abstraction has 5216 states and 19452 transitions. [2021-10-04 18:29:17,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 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-04 18:29:17,481 INFO L276 IsEmpty]: Start isEmpty. Operand 5216 states and 19452 transitions. [2021-10-04 18:29:17,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-04 18:29:17,499 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:17,499 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 1, 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-04 18:29:17,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-10-04 18:29:17,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-04 18:29:17,715 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-04 18:29:17,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:17,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1665227334, now seen corresponding path program 2 times [2021-10-04 18:29:17,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:17,716 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865785472] [2021-10-04 18:29:17,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:17,716 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-10-04 18:29:17,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:17,806 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865785472] [2021-10-04 18:29:17,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865785472] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:17,807 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569355031] [2021-10-04 18:29:17,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-04 18:29:17,807 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-04 18:29:17,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-04 18:29:17,809 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-04 18:29:17,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-10-04 18:29:18,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-04 18:29:18,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-04 18:29:18,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-04 18:29:18,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-04 18:29:18,232 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-10-04 18:29:18,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569355031] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:18,232 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-04 18:29:18,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2021-10-04 18:29:18,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747126567] [2021-10-04 18:29:18,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-04 18:29:18,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:18,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-04 18:29:18,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-04 18:29:18,235 INFO L87 Difference]: Start difference. First operand 5216 states and 19452 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 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-04 18:29:18,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:18,329 INFO L93 Difference]: Finished difference Result 7786 states and 29233 transitions. [2021-10-04 18:29:18,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-04 18:29:18,330 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 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 54 [2021-10-04 18:29:18,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:18,370 INFO L225 Difference]: With dead ends: 7786 [2021-10-04 18:29:18,371 INFO L226 Difference]: Without dead ends: 7786 [2021-10-04 18:29:18,371 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 39.0ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-04 18:29:18,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7786 states. [2021-10-04 18:29:18,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7786 to 6516. [2021-10-04 18:29:18,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6516 states, 6515 states have (on average 3.7448963929393706) internal successors, (24398), 6515 states have internal predecessors, (24398), 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-04 18:29:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6516 states to 6516 states and 24398 transitions. [2021-10-04 18:29:18,715 INFO L78 Accepts]: Start accepts. Automaton has 6516 states and 24398 transitions. Word has length 54 [2021-10-04 18:29:18,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:18,716 INFO L470 AbstractCegarLoop]: Abstraction has 6516 states and 24398 transitions. [2021-10-04 18:29:18,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 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-04 18:29:18,716 INFO L276 IsEmpty]: Start isEmpty. Operand 6516 states and 24398 transitions. [2021-10-04 18:29:18,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-10-04 18:29:18,739 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:18,740 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 1, 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-04 18:29:18,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-10-04 18:29:18,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-10-04 18:29:18,953 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-04 18:29:18,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:18,954 INFO L82 PathProgramCache]: Analyzing trace with hash 2124482765, now seen corresponding path program 3 times [2021-10-04 18:29:18,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:18,955 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633586189] [2021-10-04 18:29:18,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:18,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:19,043 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-10-04 18:29:19,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:19,044 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633586189] [2021-10-04 18:29:19,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633586189] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:19,044 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132808992] [2021-10-04 18:29:19,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-04 18:29:19,044 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-04 18:29:19,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-04 18:29:19,046 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-04 18:29:19,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-10-04 18:29:19,910 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-10-04 18:29:19,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-04 18:29:19,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-04 18:29:19,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-04 18:29:20,063 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-10-04 18:29:20,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132808992] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:20,064 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-04 18:29:20,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-10-04 18:29:20,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429813274] [2021-10-04 18:29:20,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:29:20,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:20,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:29:20,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:29:20,066 INFO L87 Difference]: Start difference. First operand 6516 states and 24398 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 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-04 18:29:20,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:20,196 INFO L93 Difference]: Finished difference Result 9086 states and 34179 transitions. [2021-10-04 18:29:20,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-04 18:29:20,196 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 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 56 [2021-10-04 18:29:20,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:20,236 INFO L225 Difference]: With dead ends: 9086 [2021-10-04 18:29:20,236 INFO L226 Difference]: Without dead ends: 9086 [2021-10-04 18:29:20,237 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 57.5ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:29:20,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9086 states. [2021-10-04 18:29:20,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9086 to 7816. [2021-10-04 18:29:20,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7816 states, 7815 states have (on average 3.7548304542546385) internal successors, (29344), 7815 states have internal predecessors, (29344), 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-04 18:29:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7816 states to 7816 states and 29344 transitions. [2021-10-04 18:29:20,627 INFO L78 Accepts]: Start accepts. Automaton has 7816 states and 29344 transitions. Word has length 56 [2021-10-04 18:29:20,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:20,628 INFO L470 AbstractCegarLoop]: Abstraction has 7816 states and 29344 transitions. [2021-10-04 18:29:20,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 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-04 18:29:20,628 INFO L276 IsEmpty]: Start isEmpty. Operand 7816 states and 29344 transitions. [2021-10-04 18:29:20,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-04 18:29:20,655 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:20,656 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 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-04 18:29:20,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-10-04 18:29:20,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-10-04 18:29:20,869 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:29:20,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:20,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1903620896, now seen corresponding path program 4 times [2021-10-04 18:29:20,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:20,871 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35826516] [2021-10-04 18:29:20,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:20,872 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:29:20,974 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-10-04 18:29:20,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:29:20,974 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35826516] [2021-10-04 18:29:20,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35826516] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:20,975 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877481551] [2021-10-04 18:29:20,975 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-04 18:29:20,975 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-04 18:29:20,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-04 18:29:20,976 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-04 18:29:20,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-10-04 18:29:21,383 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-04 18:29:21,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-04 18:29:21,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-04 18:29:21,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-04 18:29:21,566 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-10-04 18:29:21,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877481551] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-04 18:29:21,567 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-04 18:29:21,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-10-04 18:29:21,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387285834] [2021-10-04 18:29:21,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-04 18:29:21,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:29:21,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-04 18:29:21,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:29:21,570 INFO L87 Difference]: Start difference. First operand 7816 states and 29344 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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-04 18:29:21,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:29:21,709 INFO L93 Difference]: Finished difference Result 9736 states and 36652 transitions. [2021-10-04 18:29:21,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-04 18:29:21,710 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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 58 [2021-10-04 18:29:21,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:29:21,755 INFO L225 Difference]: With dead ends: 9736 [2021-10-04 18:29:21,755 INFO L226 Difference]: Without dead ends: 9736 [2021-10-04 18:29:21,756 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 54.0ms TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-10-04 18:29:21,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9736 states. [2021-10-04 18:29:22,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9736 to 9116. [2021-10-04 18:29:22,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9116 states, 9115 states have (on average 3.761930883159627) internal successors, (34290), 9115 states have internal predecessors, (34290), 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-04 18:29:22,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9116 states to 9116 states and 34290 transitions. [2021-10-04 18:29:22,250 INFO L78 Accepts]: Start accepts. Automaton has 9116 states and 34290 transitions. Word has length 58 [2021-10-04 18:29:22,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:29:22,250 INFO L470 AbstractCegarLoop]: Abstraction has 9116 states and 34290 transitions. [2021-10-04 18:29:22,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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-04 18:29:22,250 INFO L276 IsEmpty]: Start isEmpty. Operand 9116 states and 34290 transitions. [2021-10-04 18:29:22,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-04 18:29:22,296 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:29:22,296 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 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-04 18:29:22,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-10-04 18:29:22,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-10-04 18:29:22,512 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:29:22,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:29:22,513 INFO L82 PathProgramCache]: Analyzing trace with hash 108762291, now seen corresponding path program 5 times [2021-10-04 18:29:22,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:29:22,514 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869610217] [2021-10-04 18:29:22,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:29:22,514 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:29:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-04 18:29:22,729 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-04 18:29:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-04 18:29:22,899 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-04 18:29:22,900 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-04 18:29:22,901 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-04 18:29:22,903 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-04 18:29:22,903 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-04 18:29:22,903 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-04 18:29:22,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-04 18:29:22,911 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-04 18:29:22,911 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-04 18:29:23,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 06:29:23 BasicIcfg [2021-10-04 18:29:23,057 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-04 18:29:23,058 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-04 18:29:23,058 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-04 18:29:23,059 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-04 18:29:23,059 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 06:28:53" (3/4) ... [2021-10-04 18:29:23,061 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-04 18:29:23,221 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-10-04 18:29:23,222 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-04 18:29:23,224 INFO L168 Benchmark]: Toolchain (without parser) took 30566.95 ms. Allocated memory was 50.3 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 27.1 MB in the beginning and 835.7 MB in the end (delta: -808.7 MB). Peak memory consumption was 405.6 MB. Max. memory is 16.1 GB. [2021-10-04 18:29:23,224 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 41.9 MB. Free memory is still 23.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-04 18:29:23,225 INFO L168 Benchmark]: CACSL2BoogieTranslator took 423.05 ms. Allocated memory is still 50.3 MB. Free memory was 26.8 MB in the beginning and 29.3 MB in the end (delta: -2.5 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2021-10-04 18:29:23,225 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.34 ms. Allocated memory is still 50.3 MB. Free memory was 29.3 MB in the beginning and 27.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-04 18:29:23,226 INFO L168 Benchmark]: Boogie Preprocessor took 81.53 ms. Allocated memory is still 50.3 MB. Free memory was 27.3 MB in the beginning and 25.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-04 18:29:23,226 INFO L168 Benchmark]: RCFGBuilder took 667.34 ms. Allocated memory is still 50.3 MB. Free memory was 25.5 MB in the beginning and 21.8 MB in the end (delta: 3.7 MB). Peak memory consumption was 6.4 MB. Max. memory is 16.1 GB. [2021-10-04 18:29:23,226 INFO L168 Benchmark]: TraceAbstraction took 29117.57 ms. Allocated memory was 60.8 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 42.8 MB in the beginning and 853.5 MB in the end (delta: -810.7 MB). Peak memory consumption was 390.2 MB. Max. memory is 16.1 GB. [2021-10-04 18:29:23,227 INFO L168 Benchmark]: Witness Printer took 163.99 ms. Allocated memory is still 1.3 GB. Free memory was 853.5 MB in the beginning and 835.7 MB in the end (delta: 17.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-10-04 18:29:23,230 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.28 ms. Allocated memory is still 41.9 MB. Free memory is still 23.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 423.05 ms. Allocated memory is still 50.3 MB. Free memory was 26.8 MB in the beginning and 29.3 MB in the end (delta: -2.5 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 85.34 ms. Allocated memory is still 50.3 MB. Free memory was 29.3 MB in the beginning and 27.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 81.53 ms. Allocated memory is still 50.3 MB. Free memory was 27.3 MB in the beginning and 25.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 667.34 ms. Allocated memory is still 50.3 MB. Free memory was 25.5 MB in the beginning and 21.8 MB in the end (delta: 3.7 MB). Peak memory consumption was 6.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 29117.57 ms. Allocated memory was 60.8 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 42.8 MB in the beginning and 853.5 MB in the end (delta: -810.7 MB). Peak memory consumption was 390.2 MB. Max. memory is 16.1 GB. * Witness Printer took 163.99 ms. Allocated memory is still 1.3 GB. Free memory was 853.5 MB in the beginning and 835.7 MB in the end (delta: 17.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7002.4ms, 200 PlacesBefore, 41 PlacesAfterwards, 212 TransitionsBefore, 40 TransitionsAfterwards, 4272 CoEnabledTransitionPairs, 7 FixpointIterations, 109 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 9 ConcurrentYvCompositions, 13 ChoiceCompositions, 208 TotalNumberOfCompositions, 5981 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4386, positive: 4248, positive conditional: 0, positive unconditional: 4248, negative: 138, negative conditional: 0, negative unconditional: 138, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2923, positive: 2888, positive conditional: 0, positive unconditional: 2888, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2923, positive: 2888, positive conditional: 0, positive unconditional: 2888, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 35, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 90, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 90, negative conditional: 0, negative unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4386, positive: 1360, positive conditional: 0, positive unconditional: 1360, negative: 103, negative conditional: 0, negative unconditional: 103, unknown: 2923, unknown conditional: 0, unknown unconditional: 2923] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 148, Positive conditional cache size: 0, Positive unconditional cache size: 148, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - 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 - CounterExampleResult [Line: 79]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] 0 int *a1, *a2, *a3; [L18] 0 int res1, res2, res3; [L19] 0 _Bool isNull1, isNull2, isNull3; [L61] 0 pthread_t t1, t2, t3; [L14] COND FALSE 0 !(!cond) [L85] 0 int* arr = (int*)malloc(sizeof(int) * size); [L86] 0 int i = 0; VAL [a1={0:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={0:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={0:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={0:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={0:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={0:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND FALSE 0 !(i < size) [L89] 0 return arr; [L63] 0 a1 = create_fresh_int_array(5) [L14] COND FALSE 0 !(!cond) [L85] 0 int* arr = (int*)malloc(sizeof(int) * size); [L86] 0 int i = 0; VAL [a1={2:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={2:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={2:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={2:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={2:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={2:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND FALSE 0 !(i < size) [L89] 0 return arr; [L64] 0 a2 = create_fresh_int_array(5) [L14] COND FALSE 0 !(!cond) [L85] 0 int* arr = (int*)malloc(sizeof(int) * size); [L86] 0 int i = 0; VAL [a1={2:0}, a2={3:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={2:0}, a2={3:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={2:0}, a2={3:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={2:0}, a2={3:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={2:0}, a2={3:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={2:0}, a2={3:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND FALSE 0 !(i < size) [L89] 0 return arr; [L65] 0 a3 = create_fresh_int_array(5) [L66] 0 isNull1 = __VERIFIER_nondet_bool() [L67] 0 isNull2 = __VERIFIER_nondet_bool() [L68] 0 isNull3 = __VERIFIER_nondet_bool() [L71] FCALL, FORK 0 pthread_create(&t1, NULL, thread1, NULL) VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=0, res2=0, res3=0] [L72] FCALL, FORK 0 pthread_create(&t2, NULL, thread2, NULL) VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=0, res2=0, res3=0] [L73] FCALL, FORK 0 pthread_create(&t3, NULL, thread3, NULL) VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=0, res2=0, res3=0] [L49] 3 int i = 0; [L14] COND FALSE 3 !(!cond) VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=0, res2=0, res3=0] [L51] COND TRUE 3 !isNull3 && i < 5 [L52] EXPR 3 a1[i] [L52] EXPR 3 a3[i] [L52] 3 res2 = a1[i] - a3[i] [L74] 0 \read(t1) VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=0, res2=-3, res3=0] [L53] COND FALSE 3 !(res2 == 0) [L56] 3 i++ VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=0, res2=-3, res3=0] [L51] COND TRUE 3 !isNull3 && i < 5 [L52] EXPR 3 a1[i] [L52] EXPR 3 a3[i] [L52] 3 res2 = a1[i] - a3[i] [L53] COND FALSE 3 !(res2 == 0) [L56] 3 i++ VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=0, res2=4, res3=0] [L51] COND TRUE 3 !isNull3 && i < 5 [L52] EXPR 3 a1[i] [L52] EXPR 3 a3[i] [L52] 3 res2 = a1[i] - a3[i] [L53] COND FALSE 3 !(res2 == 0) [L56] 3 i++ VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=0, res2=-1, res3=0] [L51] COND TRUE 3 !isNull3 && i < 5 [L52] EXPR 3 a1[i] [L52] EXPR 3 a3[i] [L52] 3 res2 = a1[i] - a3[i] [L53] COND FALSE 3 !(res2 == 0) [L56] 3 i++ VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=0, res2=1, res3=0] [L24] 1 int i = 0; [L14] COND FALSE 1 !(!cond) [L26] 1 res1 = 1 VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=1, res2=1, res3=0] [L27] COND TRUE 1 !isNull2 && i < 5 [L28] EXPR 1 a1[i] VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=1, res2=1, res3=0] [L28] EXPR 1 a2[i] [L28] 1 res1 = a1[i] - a2[i] [L29] COND FALSE 1 !(res1 == 0) [L32] 1 i++ VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=-3, res2=1, res3=0] [L27] COND TRUE 1 !isNull2 && i < 5 [L28] EXPR 1 a1[i] VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=-3, res2=1, res3=0] [L28] EXPR 1 a2[i] [L28] 1 res1 = a1[i] - a2[i] [L29] COND FALSE 1 !(res1 == 0) [L32] 1 i++ VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=-1, res2=1, res3=0] [L27] COND TRUE 1 !isNull2 && i < 5 [L28] EXPR 1 a1[i] VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=-1, res2=1, res3=0] [L28] EXPR 1 a2[i] [L28] 1 res1 = a1[i] - a2[i] [L29] COND FALSE 1 !(res1 == 0) [L32] 1 i++ VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=1, res2=1, res3=0] [L27] COND TRUE 1 !isNull2 && i < 5 [L28] EXPR 1 a1[i] VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=1, res2=1, res3=0] [L28] EXPR 1 a2[i] [L28] 1 res1 = a1[i] - a2[i] [L29] COND FALSE 1 !(res1 == 0) [L32] 1 i++ VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=-1, res2=1, res3=0] [L27] COND TRUE 1 !isNull2 && i < 5 [L28] EXPR 1 a1[i] VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=-1, res2=1, res3=0] [L28] EXPR 1 a2[i] [L28] 1 res1 = a1[i] - a2[i] [L29] COND FALSE 1 !(res1 == 0) [L32] 1 i++ VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=2, res2=1, res3=0] [L27] COND FALSE 1 !(!isNull2 && i < 5) [L74] FCALL, JOIN 1 pthread_join(t1, 0) VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=2, res2=1, res3=0] [L75] 0 \read(t2) VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=2, res2=1, res3=0] [L37] 2 int i = 0; [L14] COND FALSE 2 !(!cond) VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=2, res2=1, res3=0] [L39] COND TRUE 2 !isNull3 && i < 5 [L40] EXPR 2 a2[i] VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=2, res2=1, res3=0] [L40] EXPR 2 a3[i] VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=2, res2=1, res3=0] [L40] 2 res2 = a2[i] - a3[i] VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=2, res2=0, res3=0] [L41] COND TRUE 2 res2 == 0 [L51] COND TRUE 3 !isNull3 && i < 5 [L52] EXPR 3 a1[i] [L52] EXPR 3 a3[i] [L52] 3 res2 = a1[i] - a3[i] [L75] FCALL, JOIN 2 pthread_join(t2, 0) VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=2, res2=1, res3=0] [L53] COND FALSE 3 !(res2 == 0) [L56] 3 i++ VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=2, res2=1, res3=0] [L51] COND FALSE 3 !(!isNull3 && i < 5) [L76] 0 \read(t3) VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=2, res2=1, res3=0] [L76] FCALL, JOIN 3 pthread_join(t3, 0) VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=2, res2=1, res3=0] [L14] COND FALSE 0 !(!cond) [L79] 0 reach_error() VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=2, res2=1, res3=0] - UnprovableResult [Line: 72]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 249 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 28678.1ms, OverallIterations: 29, TraceHistogramMax: 5, EmptinessCheckTime: 306.5ms, AutomataDifference: 2999.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7120.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1547 SDtfs, 2136 SDslu, 3072 SDs, 0 SdLazy, 786 SolverSat, 185 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 797.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 918 GetRequests, 773 SyntacticMatches, 10 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 780.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=9116occurred in iteration=28, InterpolantAutomatonStates: 146, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 3750.8ms AutomataMinimizationTime, 28 MinimizatonAttempts, 22666 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 411.4ms SsaConstructionTime, 2787.1ms SatisfiabilityAnalysisTime, 4511.8ms InterpolantComputationTime, 2027 NumberOfCodeBlocks, 1998 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 1921 ConstructedInterpolants, 0 QuantifiedInterpolants, 5138 SizeOfPredicates, 32 NumberOfNonLiveVariables, 5676 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 46 InterpolantComputations, 13 PerfectInterpolantSequences, 1820/2032 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-04 18:29:23,278 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...