./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_sync.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_sync.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 459cf049271151c452003a0973bcdcc76c918d5759d842702be03de8528f67ef --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 18:44:43,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 18:44:43,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 18:44:43,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 18:44:43,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 18:44:43,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 18:44:43,711 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 18:44:43,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 18:44:43,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 18:44:43,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 18:44:43,723 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 18:44:43,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 18:44:43,725 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 18:44:43,727 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 18:44:43,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 18:44:43,729 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 18:44:43,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 18:44:43,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 18:44:43,734 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 18:44:43,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 18:44:43,741 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 18:44:43,756 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 18:44:43,756 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 18:44:43,757 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 18:44:43,757 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 18:44:43,759 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 18:44:43,759 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 18:44:43,759 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 18:44:43,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 18:44:43,760 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 18:44:43,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 18:44:43,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 18:44:43,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 18:44:43,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 18:44:43,761 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 18:44:43,762 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 18:44:43,762 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 18:44:43,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 18:44:43,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 18:44:43,763 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 18:44:43,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 18:44:43,764 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 18:44:43,764 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 18:44:43,781 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 18:44:43,781 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 18:44:43,782 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 18:44:43,782 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 18:44:43,782 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 18:44:43,782 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 18:44:43,783 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 18:44:43,783 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 18:44:43,783 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 18:44:43,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 18:44:43,784 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 18:44:43,784 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 18:44:43,784 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 18:44:43,784 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 18:44:43,784 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 18:44:43,784 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 18:44:43,784 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 18:44:43,784 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 18:44:43,785 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 18:44:43,785 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 18:44:43,785 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 18:44:43,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 18:44:43,785 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 18:44:43,785 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 18:44:43,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 18:44:43,786 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 18:44:43,786 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 18:44:43,786 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 18:44:43,786 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 18:44:43,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 18:44:43,786 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 18:44:43,787 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 18:44:43,787 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 18:44:43,787 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 459cf049271151c452003a0973bcdcc76c918d5759d842702be03de8528f67ef [2022-07-19 18:44:44,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 18:44:44,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 18:44:44,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 18:44:44,033 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 18:44:44,034 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 18:44:44,035 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_sync.i [2022-07-19 18:44:44,088 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29d9a2a76/3d467dfc5c4842ab81c2fa526d9b41c1/FLAG1c12c9eb2 [2022-07-19 18:44:44,542 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 18:44:44,542 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_sync.i [2022-07-19 18:44:44,553 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29d9a2a76/3d467dfc5c4842ab81c2fa526d9b41c1/FLAG1c12c9eb2 [2022-07-19 18:44:44,574 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29d9a2a76/3d467dfc5c4842ab81c2fa526d9b41c1 [2022-07-19 18:44:44,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 18:44:44,577 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 18:44:44,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 18:44:44,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 18:44:44,585 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 18:44:44,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 06:44:44" (1/1) ... [2022-07-19 18:44:44,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@749e552f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:44, skipping insertion in model container [2022-07-19 18:44:44,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 06:44:44" (1/1) ... [2022-07-19 18:44:44,591 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 18:44:44,628 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 18:44:44,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_sync.i[34698,34711] [2022-07-19 18:44:45,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 18:44:45,041 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 18:44:45,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_sync.i[34698,34711] [2022-07-19 18:44:45,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 18:44:45,135 INFO L208 MainTranslator]: Completed translation [2022-07-19 18:44:45,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:45 WrapperNode [2022-07-19 18:44:45,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 18:44:45,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 18:44:45,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 18:44:45,137 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 18:44:45,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:45" (1/1) ... [2022-07-19 18:44:45,186 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:45" (1/1) ... [2022-07-19 18:44:45,222 INFO L137 Inliner]: procedures = 245, calls = 244, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 544 [2022-07-19 18:44:45,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 18:44:45,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 18:44:45,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 18:44:45,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 18:44:45,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:45" (1/1) ... [2022-07-19 18:44:45,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:45" (1/1) ... [2022-07-19 18:44:45,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:45" (1/1) ... [2022-07-19 18:44:45,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:45" (1/1) ... [2022-07-19 18:44:45,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:45" (1/1) ... [2022-07-19 18:44:45,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:45" (1/1) ... [2022-07-19 18:44:45,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:45" (1/1) ... [2022-07-19 18:44:45,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 18:44:45,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 18:44:45,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 18:44:45,273 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 18:44:45,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:45" (1/1) ... [2022-07-19 18:44:45,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 18:44:45,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:44:45,323 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 18:44:45,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 18:44:45,364 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 18:44:45,365 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 18:44:45,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 18:44:45,365 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_signal [2022-07-19 18:44:45,365 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_signal [2022-07-19 18:44:45,365 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-07-19 18:44:45,367 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-07-19 18:44:45,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 18:44:45,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 18:44:45,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 18:44:45,367 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-07-19 18:44:45,367 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-07-19 18:44:45,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 18:44:45,368 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_init [2022-07-19 18:44:45,368 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_init [2022-07-19 18:44:45,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 18:44:45,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 18:44:45,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 18:44:45,369 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-07-19 18:44:45,369 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-07-19 18:44:45,369 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_wait [2022-07-19 18:44:45,369 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_wait [2022-07-19 18:44:45,369 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-07-19 18:44:45,369 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-07-19 18:44:45,369 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-19 18:44:45,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-19 18:44:45,369 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-07-19 18:44:45,370 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-07-19 18:44:45,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 18:44:45,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 18:44:45,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 18:44:45,543 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 18:44:45,544 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 18:44:45,814 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !(0 != ~__CS_ret~0 % 256); [2022-07-19 18:44:45,814 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-19 18:44:45,815 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !(0 != ~__CS_ret~0 % 256); [2022-07-19 18:44:45,815 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-19 18:44:45,815 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L991: SUMMARY for call __CS_cs(); srcloc: null [2022-07-19 18:44:45,815 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-19 18:44:45,815 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume !(0 != ~__CS_ret~0 % 256); [2022-07-19 18:44:48,087 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 18:44:48,094 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 18:44:48,094 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-19 18:44:48,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 06:44:48 BoogieIcfgContainer [2022-07-19 18:44:48,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 18:44:48,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 18:44:48,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 18:44:48,101 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 18:44:48,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 06:44:44" (1/3) ... [2022-07-19 18:44:48,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc2adcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 06:44:48, skipping insertion in model container [2022-07-19 18:44:48,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:45" (2/3) ... [2022-07-19 18:44:48,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc2adcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 06:44:48, skipping insertion in model container [2022-07-19 18:44:48,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 06:44:48" (3/3) ... [2022-07-19 18:44:48,103 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_sync.i [2022-07-19 18:44:48,113 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 18:44:48,113 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 18:44:48,166 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 18:44:48,190 INFO L357 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, mAutomataTypeConcurrency=PETRI_NET, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7ecb4a71, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@36002e4a [2022-07-19 18:44:48,192 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 18:44:48,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 194 states, 127 states have (on average 1.4566929133858268) internal successors, (185), 128 states have internal predecessors, (185), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-07-19 18:44:48,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-19 18:44:48,210 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:48,211 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:44:48,211 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:48,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:48,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1902090431, now seen corresponding path program 1 times [2022-07-19 18:44:48,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:48,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667144932] [2022-07-19 18:44:48,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:48,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:44:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:48,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 18:44:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:48,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 18:44:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:48,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 18:44:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:48,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 18:44:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:48,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 18:44:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:48,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 18:44:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:48,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 18:44:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:48,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 18:44:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:48,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-19 18:44:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:48,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 18:44:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:48,709 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-19 18:44:48,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:44:48,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667144932] [2022-07-19 18:44:48,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667144932] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:44:48,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:44:48,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 18:44:48,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643037357] [2022-07-19 18:44:48,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:44:48,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 18:44:48,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:44:48,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 18:44:48,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 18:44:48,741 INFO L87 Difference]: Start difference. First operand has 194 states, 127 states have (on average 1.4566929133858268) internal successors, (185), 128 states have internal predecessors, (185), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 18:44:48,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:44:48,827 INFO L93 Difference]: Finished difference Result 390 states and 641 transitions. [2022-07-19 18:44:48,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 18:44:48,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2022-07-19 18:44:48,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:44:48,837 INFO L225 Difference]: With dead ends: 390 [2022-07-19 18:44:48,837 INFO L226 Difference]: Without dead ends: 194 [2022-07-19 18:44:48,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 18:44:48,848 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 4 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 18:44:48,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 568 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 18:44:48,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-19 18:44:48,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2022-07-19 18:44:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 125 states have (on average 1.4) internal successors, (175), 125 states have internal predecessors, (175), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-07-19 18:44:48,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 285 transitions. [2022-07-19 18:44:48,912 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 285 transitions. Word has length 72 [2022-07-19 18:44:48,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:44:48,913 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 285 transitions. [2022-07-19 18:44:48,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 18:44:48,913 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 285 transitions. [2022-07-19 18:44:48,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-19 18:44:48,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:48,926 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:44:48,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 18:44:48,927 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:48,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:48,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1569921272, now seen corresponding path program 1 times [2022-07-19 18:44:48,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:48,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971576969] [2022-07-19 18:44:48,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:48,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:44:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 18:44:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 18:44:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 18:44:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 18:44:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 18:44:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 18:44:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 18:44:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 18:44:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 18:44:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 18:44:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,131 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-19 18:44:49,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:44:49,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971576969] [2022-07-19 18:44:49,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971576969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:44:49,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:44:49,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 18:44:49,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776703059] [2022-07-19 18:44:49,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:44:49,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 18:44:49,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:44:49,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 18:44:49,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 18:44:49,135 INFO L87 Difference]: Start difference. First operand 191 states and 285 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 18:44:49,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:44:49,183 INFO L93 Difference]: Finished difference Result 381 states and 570 transitions. [2022-07-19 18:44:49,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 18:44:49,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 75 [2022-07-19 18:44:49,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:44:49,190 INFO L225 Difference]: With dead ends: 381 [2022-07-19 18:44:49,190 INFO L226 Difference]: Without dead ends: 193 [2022-07-19 18:44:49,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 18:44:49,192 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 1 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 18:44:49,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 561 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 18:44:49,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-19 18:44:49,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2022-07-19 18:44:49,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 126 states have (on average 1.3968253968253967) internal successors, (176), 126 states have internal predecessors, (176), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-07-19 18:44:49,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 286 transitions. [2022-07-19 18:44:49,211 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 286 transitions. Word has length 75 [2022-07-19 18:44:49,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:44:49,212 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 286 transitions. [2022-07-19 18:44:49,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 18:44:49,213 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 286 transitions. [2022-07-19 18:44:49,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-19 18:44:49,214 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:49,214 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:44:49,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 18:44:49,216 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:49,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:49,216 INFO L85 PathProgramCache]: Analyzing trace with hash 217866074, now seen corresponding path program 1 times [2022-07-19 18:44:49,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:49,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669558863] [2022-07-19 18:44:49,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:49,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:44:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 18:44:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 18:44:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 18:44:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 18:44:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 18:44:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 18:44:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 18:44:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 18:44:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 18:44:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 18:44:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,394 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-19 18:44:49,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:44:49,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669558863] [2022-07-19 18:44:49,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669558863] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:44:49,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009114289] [2022-07-19 18:44:49,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:49,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:44:49,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:44:49,397 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:44:49,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 18:44:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 1763 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 18:44:49,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:44:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-19 18:44:49,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:44:49,972 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-19 18:44:49,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009114289] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 18:44:49,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 18:44:49,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-19 18:44:49,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608820067] [2022-07-19 18:44:49,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 18:44:49,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 18:44:49,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:44:49,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 18:44:49,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-19 18:44:49,974 INFO L87 Difference]: Start difference. First operand 192 states and 286 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-19 18:44:50,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:44:50,005 INFO L93 Difference]: Finished difference Result 385 states and 575 transitions. [2022-07-19 18:44:50,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 18:44:50,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 77 [2022-07-19 18:44:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:44:50,007 INFO L225 Difference]: With dead ends: 385 [2022-07-19 18:44:50,007 INFO L226 Difference]: Without dead ends: 196 [2022-07-19 18:44:50,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-19 18:44:50,009 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 3 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 18:44:50,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1119 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 18:44:50,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-19 18:44:50,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-07-19 18:44:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 130 states have internal predecessors, (180), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-07-19 18:44:50,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 290 transitions. [2022-07-19 18:44:50,021 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 290 transitions. Word has length 77 [2022-07-19 18:44:50,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:44:50,021 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 290 transitions. [2022-07-19 18:44:50,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-19 18:44:50,021 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 290 transitions. [2022-07-19 18:44:50,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-19 18:44:50,030 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:50,030 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:44:50,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 18:44:50,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:44:50,244 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:50,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:50,244 INFO L85 PathProgramCache]: Analyzing trace with hash 971561630, now seen corresponding path program 2 times [2022-07-19 18:44:50,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:50,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972262550] [2022-07-19 18:44:50,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:50,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:44:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:50,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 18:44:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:50,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 18:44:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:50,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 18:44:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:50,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 18:44:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:50,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 18:44:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:50,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 18:44:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:50,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 18:44:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:50,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 18:44:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:50,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 18:44:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:50,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 18:44:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:50,407 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-07-19 18:44:50,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:44:50,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972262550] [2022-07-19 18:44:50,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972262550] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:44:50,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100935445] [2022-07-19 18:44:50,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 18:44:50,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:44:50,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:44:50,410 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:44:50,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 18:44:51,071 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 18:44:51,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 18:44:51,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 18:44:51,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:44:51,180 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-19 18:44:51,181 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 18:44:51,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100935445] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:44:51,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 18:44:51,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-19 18:44:51,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649693571] [2022-07-19 18:44:51,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:44:51,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 18:44:51,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:44:51,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 18:44:51,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 18:44:51,183 INFO L87 Difference]: Start difference. First operand 196 states and 290 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 18:44:51,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:44:51,207 INFO L93 Difference]: Finished difference Result 377 states and 570 transitions. [2022-07-19 18:44:51,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 18:44:51,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 81 [2022-07-19 18:44:51,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:44:51,210 INFO L225 Difference]: With dead ends: 377 [2022-07-19 18:44:51,210 INFO L226 Difference]: Without dead ends: 351 [2022-07-19 18:44:51,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-19 18:44:51,212 INFO L413 NwaCegarLoop]: 392 mSDtfsCounter, 230 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 18:44:51,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1057 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 18:44:51,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-07-19 18:44:51,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 350. [2022-07-19 18:44:51,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 230 states have (on average 1.4130434782608696) internal successors, (325), 230 states have internal predecessors, (325), 99 states have call successors, (99), 20 states have call predecessors, (99), 20 states have return successors, (107), 99 states have call predecessors, (107), 99 states have call successors, (107) [2022-07-19 18:44:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 531 transitions. [2022-07-19 18:44:51,229 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 531 transitions. Word has length 81 [2022-07-19 18:44:51,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:44:51,230 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 531 transitions. [2022-07-19 18:44:51,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 18:44:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 531 transitions. [2022-07-19 18:44:51,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-19 18:44:51,236 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:51,236 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:44:51,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 18:44:51,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-19 18:44:51,448 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:51,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:51,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1383247446, now seen corresponding path program 1 times [2022-07-19 18:44:51,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:51,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131549434] [2022-07-19 18:44:51,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:51,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:44:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 18:44:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 18:44:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:44:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:44:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 18:44:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 18:44:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:44:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:44:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 18:44:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:44:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:44:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 18:44:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 18:44:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:44:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:44:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 18:44:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 18:44:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-19 18:44:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-19 18:44:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-19 18:44:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-19 18:44:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-19 18:44:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-19 18:44:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-19 18:44:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 18:44:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:51,762 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2022-07-19 18:44:51,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:44:51,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131549434] [2022-07-19 18:44:51,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131549434] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:44:51,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402745298] [2022-07-19 18:44:51,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:51,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:44:51,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:44:51,765 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:44:51,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 18:44:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:52,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 2184 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 18:44:52,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:44:52,433 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2022-07-19 18:44:52,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:44:52,568 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2022-07-19 18:44:52,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402745298] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 18:44:52,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 18:44:52,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 9 [2022-07-19 18:44:52,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725460100] [2022-07-19 18:44:52,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 18:44:52,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 18:44:52,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:44:52,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 18:44:52,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-19 18:44:52,570 INFO L87 Difference]: Start difference. First operand 350 states and 531 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (45), 6 states have call predecessors, (45), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2022-07-19 18:44:54,620 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:44:56,638 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:44:57,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:44:57,168 INFO L93 Difference]: Finished difference Result 719 states and 1092 transitions. [2022-07-19 18:44:57,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 18:44:57,168 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (45), 6 states have call predecessors, (45), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 183 [2022-07-19 18:44:57,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:44:57,171 INFO L225 Difference]: With dead ends: 719 [2022-07-19 18:44:57,171 INFO L226 Difference]: Without dead ends: 381 [2022-07-19 18:44:57,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 410 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-19 18:44:57,173 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 108 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 175 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-19 18:44:57,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 929 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 556 Invalid, 2 Unknown, 0 Unchecked, 4.5s Time] [2022-07-19 18:44:57,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-07-19 18:44:57,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 363. [2022-07-19 18:44:57,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 241 states have (on average 1.3983402489626555) internal successors, (337), 243 states have internal predecessors, (337), 99 states have call successors, (99), 20 states have call predecessors, (99), 22 states have return successors, (111), 99 states have call predecessors, (111), 99 states have call successors, (111) [2022-07-19 18:44:57,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 547 transitions. [2022-07-19 18:44:57,188 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 547 transitions. Word has length 183 [2022-07-19 18:44:57,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:44:57,189 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 547 transitions. [2022-07-19 18:44:57,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (45), 6 states have call predecessors, (45), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2022-07-19 18:44:57,189 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 547 transitions. [2022-07-19 18:44:57,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-07-19 18:44:57,191 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:57,192 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:44:57,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 18:44:57,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:44:57,408 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:57,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:57,408 INFO L85 PathProgramCache]: Analyzing trace with hash -945252521, now seen corresponding path program 2 times [2022-07-19 18:44:57,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:57,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619471133] [2022-07-19 18:44:57,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:57,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:45:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:11,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 18:45:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:11,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 18:45:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:11,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:11,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:11,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 18:45:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:11,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 18:45:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:11,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:11,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:11,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 18:45:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:11,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:11,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:11,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 18:45:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:11,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 18:45:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:11,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:11,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:11,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-19 18:45:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:11,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-19 18:45:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:11,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-19 18:45:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:11,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-19 18:45:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:11,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-19 18:45:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:11,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-19 18:45:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:11,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-19 18:45:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:11,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-19 18:45:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:11,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-19 18:45:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:11,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-19 18:45:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:11,274 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2022-07-19 18:45:11,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:45:11,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619471133] [2022-07-19 18:45:11,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619471133] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:45:11,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430937820] [2022-07-19 18:45:11,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 18:45:11,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:45:11,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:45:11,276 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:45:11,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 18:45:12,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 18:45:12,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 18:45:12,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 1583 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 18:45:12,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:45:12,064 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2022-07-19 18:45:12,064 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 18:45:12,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430937820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:45:12,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 18:45:12,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-19 18:45:12,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971422663] [2022-07-19 18:45:12,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:45:12,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 18:45:12,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:45:12,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 18:45:12,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-19 18:45:12,066 INFO L87 Difference]: Start difference. First operand 363 states and 547 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-19 18:45:12,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:45:12,081 INFO L93 Difference]: Finished difference Result 695 states and 1053 transitions. [2022-07-19 18:45:12,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 18:45:12,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 192 [2022-07-19 18:45:12,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:45:12,084 INFO L225 Difference]: With dead ends: 695 [2022-07-19 18:45:12,084 INFO L226 Difference]: Without dead ends: 363 [2022-07-19 18:45:12,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-19 18:45:12,086 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 0 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 18:45:12,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 562 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 18:45:12,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-07-19 18:45:12,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2022-07-19 18:45:12,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 241 states have (on average 1.3941908713692945) internal successors, (336), 243 states have internal predecessors, (336), 99 states have call successors, (99), 20 states have call predecessors, (99), 22 states have return successors, (111), 99 states have call predecessors, (111), 99 states have call successors, (111) [2022-07-19 18:45:12,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 546 transitions. [2022-07-19 18:45:12,133 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 546 transitions. Word has length 192 [2022-07-19 18:45:12,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:45:12,135 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 546 transitions. [2022-07-19 18:45:12,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-19 18:45:12,135 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 546 transitions. [2022-07-19 18:45:12,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-07-19 18:45:12,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:45:12,144 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:45:12,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 18:45:12,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:45:12,359 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:45:12,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:45:12,360 INFO L85 PathProgramCache]: Analyzing trace with hash 342116215, now seen corresponding path program 1 times [2022-07-19 18:45:12,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:45:12,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919713235] [2022-07-19 18:45:12,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:12,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:45:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 18:45:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 18:45:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 18:45:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 18:45:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 18:45:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 18:45:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 18:45:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 18:45:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 18:45:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-19 18:45:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-19 18:45:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-19 18:45:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-19 18:45:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-19 18:45:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-19 18:45:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-19 18:45:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-19 18:45:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-19 18:45:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-19 18:45:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:12,830 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2022-07-19 18:45:12,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:45:12,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919713235] [2022-07-19 18:45:12,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919713235] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:45:12,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28421777] [2022-07-19 18:45:12,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:12,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:45:12,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:45:12,832 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:45:12,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 18:45:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 2532 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 18:45:13,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:45:13,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-07-19 18:45:13,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-19 18:45:13,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 18:45:13,832 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 400 proven. 5 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2022-07-19 18:45:13,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:45:13,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-19 18:45:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2022-07-19 18:45:14,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28421777] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 18:45:14,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 18:45:14,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2022-07-19 18:45:14,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394303290] [2022-07-19 18:45:14,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 18:45:14,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 18:45:14,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:45:14,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 18:45:14,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-19 18:45:14,048 INFO L87 Difference]: Start difference. First operand 363 states and 546 transitions. Second operand has 12 states, 12 states have (on average 9.0) internal successors, (108), 8 states have internal predecessors, (108), 8 states have call successors, (41), 8 states have call predecessors, (41), 6 states have return successors, (39), 8 states have call predecessors, (39), 8 states have call successors, (39) [2022-07-19 18:45:16,068 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:45:17,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:45:17,760 INFO L93 Difference]: Finished difference Result 845 states and 1305 transitions. [2022-07-19 18:45:17,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 18:45:17,761 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 8 states have internal predecessors, (108), 8 states have call successors, (41), 8 states have call predecessors, (41), 6 states have return successors, (39), 8 states have call predecessors, (39), 8 states have call successors, (39) Word has length 220 [2022-07-19 18:45:17,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:45:17,768 INFO L225 Difference]: With dead ends: 845 [2022-07-19 18:45:17,769 INFO L226 Difference]: Without dead ends: 815 [2022-07-19 18:45:17,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=463, Unknown=0, NotChecked=0, Total=650 [2022-07-19 18:45:17,771 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 673 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 663 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 2283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 663 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-19 18:45:17,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 1126 Invalid, 2283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [663 Valid, 1619 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2022-07-19 18:45:17,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2022-07-19 18:45:17,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 754. [2022-07-19 18:45:17,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 489 states have (on average 1.4110429447852761) internal successors, (690), 496 states have internal predecessors, (690), 215 states have call successors, (215), 40 states have call predecessors, (215), 49 states have return successors, (265), 217 states have call predecessors, (265), 215 states have call successors, (265) [2022-07-19 18:45:17,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1170 transitions. [2022-07-19 18:45:17,810 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1170 transitions. Word has length 220 [2022-07-19 18:45:17,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:45:17,810 INFO L495 AbstractCegarLoop]: Abstraction has 754 states and 1170 transitions. [2022-07-19 18:45:17,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 8 states have internal predecessors, (108), 8 states have call successors, (41), 8 states have call predecessors, (41), 6 states have return successors, (39), 8 states have call predecessors, (39), 8 states have call successors, (39) [2022-07-19 18:45:17,811 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1170 transitions. [2022-07-19 18:45:17,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-19 18:45:17,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:45:17,815 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:45:17,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 18:45:18,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:45:18,031 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:45:18,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:45:18,032 INFO L85 PathProgramCache]: Analyzing trace with hash -26567542, now seen corresponding path program 1 times [2022-07-19 18:45:18,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:45:18,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662858379] [2022-07-19 18:45:18,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:18,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:45:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 18:45:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 18:45:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 18:45:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 18:45:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:23,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 18:45:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 18:45:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 18:45:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 18:45:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 18:45:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-19 18:45:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-19 18:45:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-19 18:45:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-19 18:45:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-19 18:45:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-19 18:45:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-19 18:45:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-19 18:45:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-19 18:45:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-19 18:45:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:23,686 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2022-07-19 18:45:23,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:45:23,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662858379] [2022-07-19 18:45:23,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662858379] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:45:23,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655603050] [2022-07-19 18:45:23,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:23,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:45:23,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:45:23,689 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:45:23,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 18:45:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:24,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 2496 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 18:45:24,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:45:24,966 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2022-07-19 18:45:24,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 18:45:24,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655603050] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:45:24,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 18:45:24,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 15 [2022-07-19 18:45:24,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525745240] [2022-07-19 18:45:24,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:45:24,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 18:45:24,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:45:24,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 18:45:24,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-07-19 18:45:24,969 INFO L87 Difference]: Start difference. First operand 754 states and 1170 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 5 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-19 18:45:25,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:45:25,683 INFO L93 Difference]: Finished difference Result 1731 states and 2851 transitions. [2022-07-19 18:45:25,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 18:45:25,683 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 5 states have call predecessors, (24), 3 states have call successors, (24) Word has length 221 [2022-07-19 18:45:25,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:45:25,690 INFO L225 Difference]: With dead ends: 1731 [2022-07-19 18:45:25,690 INFO L226 Difference]: Without dead ends: 1001 [2022-07-19 18:45:25,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-07-19 18:45:25,696 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 418 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 18:45:25,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 497 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 18:45:25,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2022-07-19 18:45:25,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 963. [2022-07-19 18:45:25,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 676 states have (on average 1.3032544378698225) internal successors, (881), 574 states have internal predecessors, (881), 225 states have call successors, (225), 41 states have call predecessors, (225), 61 states have return successors, (412), 347 states have call predecessors, (412), 225 states have call successors, (412) [2022-07-19 18:45:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1518 transitions. [2022-07-19 18:45:25,770 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1518 transitions. Word has length 221 [2022-07-19 18:45:25,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:45:25,770 INFO L495 AbstractCegarLoop]: Abstraction has 963 states and 1518 transitions. [2022-07-19 18:45:25,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 5 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-19 18:45:25,771 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1518 transitions. [2022-07-19 18:45:25,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-19 18:45:25,775 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:45:25,775 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:45:25,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 18:45:25,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:45:25,995 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:45:25,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:45:25,996 INFO L85 PathProgramCache]: Analyzing trace with hash -2076186120, now seen corresponding path program 1 times [2022-07-19 18:45:25,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:45:25,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477091132] [2022-07-19 18:45:25,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:25,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:45:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 18:45:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 18:45:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 18:45:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 18:45:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 18:45:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 18:45:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 18:45:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 18:45:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 18:45:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-19 18:45:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-19 18:45:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-19 18:45:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-19 18:45:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-19 18:45:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-19 18:45:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-19 18:45:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-19 18:45:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-19 18:45:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-19 18:45:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:26,413 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2022-07-19 18:45:26,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:45:26,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477091132] [2022-07-19 18:45:26,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477091132] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:45:26,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544320685] [2022-07-19 18:45:26,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:26,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:45:26,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:45:26,415 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:45:26,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 18:45:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:27,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 2471 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 18:45:27,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:45:27,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 18:45:27,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:45:27,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 18:45:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2022-07-19 18:45:27,470 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 18:45:27,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544320685] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:45:27,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 18:45:27,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-19 18:45:27,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665663150] [2022-07-19 18:45:27,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:45:27,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 18:45:27,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:45:27,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 18:45:27,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-19 18:45:27,471 INFO L87 Difference]: Start difference. First operand 963 states and 1518 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-19 18:45:27,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:45:27,600 INFO L93 Difference]: Finished difference Result 1940 states and 3040 transitions. [2022-07-19 18:45:27,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 18:45:27,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 221 [2022-07-19 18:45:27,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:45:27,606 INFO L225 Difference]: With dead ends: 1940 [2022-07-19 18:45:27,606 INFO L226 Difference]: Without dead ends: 1017 [2022-07-19 18:45:27,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-19 18:45:27,611 INFO L413 NwaCegarLoop]: 363 mSDtfsCounter, 301 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 18:45:27,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 965 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 18:45:27,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2022-07-19 18:45:27,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 975. [2022-07-19 18:45:27,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 684 states have (on average 1.2997076023391814) internal successors, (889), 586 states have internal predecessors, (889), 225 states have call successors, (225), 41 states have call predecessors, (225), 65 states have return successors, (418), 347 states have call predecessors, (418), 225 states have call successors, (418) [2022-07-19 18:45:27,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1532 transitions. [2022-07-19 18:45:27,721 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1532 transitions. Word has length 221 [2022-07-19 18:45:27,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:45:27,721 INFO L495 AbstractCegarLoop]: Abstraction has 975 states and 1532 transitions. [2022-07-19 18:45:27,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-19 18:45:27,722 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1532 transitions. [2022-07-19 18:45:27,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-07-19 18:45:27,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:45:27,726 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:45:27,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 18:45:27,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:45:27,943 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:45:27,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:45:27,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1342111146, now seen corresponding path program 1 times [2022-07-19 18:45:27,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:45:27,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367993842] [2022-07-19 18:45:27,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:27,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:45:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 18:45:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 18:45:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 18:45:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 18:45:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 18:45:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 18:45:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 18:45:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 18:45:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 18:45:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-19 18:45:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-19 18:45:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-19 18:45:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-19 18:45:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-19 18:45:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-19 18:45:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-19 18:45:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-19 18:45:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-19 18:45:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-19 18:45:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:36,225 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 19 proven. 16 refuted. 0 times theorem prover too weak. 869 trivial. 0 not checked. [2022-07-19 18:45:36,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:45:36,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367993842] [2022-07-19 18:45:36,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367993842] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:45:36,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590398722] [2022-07-19 18:45:36,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:36,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:45:36,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:45:36,228 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:45:36,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 18:45:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:37,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 2499 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-19 18:45:37,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:45:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2022-07-19 18:45:37,497 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 18:45:37,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590398722] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:45:37,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 18:45:37,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2022-07-19 18:45:37,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141144722] [2022-07-19 18:45:37,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:45:37,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 18:45:37,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:45:37,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 18:45:37,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-07-19 18:45:37,498 INFO L87 Difference]: Start difference. First operand 975 states and 1532 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2022-07-19 18:45:38,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:45:38,898 INFO L93 Difference]: Finished difference Result 2599 states and 4124 transitions. [2022-07-19 18:45:38,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 18:45:38,898 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 220 [2022-07-19 18:45:38,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:45:38,957 INFO L225 Difference]: With dead ends: 2599 [2022-07-19 18:45:38,957 INFO L226 Difference]: Without dead ends: 1648 [2022-07-19 18:45:38,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 268 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2022-07-19 18:45:38,965 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 406 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1697 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 1914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-19 18:45:38,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1064 Invalid, 1914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1697 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-19 18:45:38,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2022-07-19 18:45:39,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1440. [2022-07-19 18:45:39,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 989 states have (on average 1.2810920121334681) internal successors, (1267), 899 states have internal predecessors, (1267), 342 states have call successors, (342), 63 states have call predecessors, (342), 108 states have return successors, (648), 477 states have call predecessors, (648), 342 states have call successors, (648) [2022-07-19 18:45:39,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 2257 transitions. [2022-07-19 18:45:39,067 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 2257 transitions. Word has length 220 [2022-07-19 18:45:39,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:45:39,068 INFO L495 AbstractCegarLoop]: Abstraction has 1440 states and 2257 transitions. [2022-07-19 18:45:39,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2022-07-19 18:45:39,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 2257 transitions. [2022-07-19 18:45:39,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-19 18:45:39,073 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:45:39,073 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:45:39,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-19 18:45:39,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-19 18:45:39,287 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:45:39,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:45:39,288 INFO L85 PathProgramCache]: Analyzing trace with hash 2117807204, now seen corresponding path program 1 times [2022-07-19 18:45:39,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:45:39,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513449626] [2022-07-19 18:45:39,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:39,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:45:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 18:45:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 18:45:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 18:45:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 18:45:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 18:45:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 18:45:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 18:45:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 18:45:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 18:45:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:45:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-19 18:45:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-19 18:45:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-19 18:45:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-19 18:45:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-19 18:45:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-19 18:45:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-19 18:45:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-19 18:45:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-19 18:45:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-19 18:45:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:53,506 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2022-07-19 18:45:53,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:45:53,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513449626] [2022-07-19 18:45:53,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513449626] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:45:53,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38196654] [2022-07-19 18:45:53,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:53,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:45:53,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:45:53,508 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:45:53,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-19 18:45:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:54,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 2510 conjuncts, 107 conjunts are in the unsatisfiable core [2022-07-19 18:45:54,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:45:55,058 INFO L356 Elim1Store]: treesize reduction 144, result has 14.8 percent of original size [2022-07-19 18:45:55,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 96 treesize of output 106 [2022-07-19 18:45:55,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 18 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2022-07-19 18:45:55,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-19 18:45:55,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-19 18:45:55,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-19 18:45:56,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 18 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2022-07-19 18:45:56,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-19 18:45:56,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-19 18:45:56,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-19 18:45:56,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:56,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:56,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:56,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:56,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:56,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:56,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:56,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:56,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:56,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:56,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:56,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:56,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:56,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:56,546 INFO L356 Elim1Store]: treesize reduction 315, result has 24.1 percent of original size [2022-07-19 18:45:56,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 720 treesize of output 318 [2022-07-19 18:45:56,580 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-19 18:45:56,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-19 18:45:56,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-19 18:45:56,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-19 18:45:56,948 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 185 proven. 33 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2022-07-19 18:45:56,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:45:57,260 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#num~0.offset| Int) (v_ArrVal_19061 (Array Int Int)) (v_ArrVal_19055 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19049 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19058 (Array Int Int)) (v_ArrVal_19046 (Array Int Int)) (v_ArrVal_19057 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store |c_#memory_int| |c_~#__CS_thread_status~0.base| v_ArrVal_19055) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19043))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19061) |c_~#empty~0.base| v_ArrVal_19058) |c_~#full~0.base| v_ArrVal_19049) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19046) |c_~#__CS_thread_status~0.base| v_ArrVal_19057) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-19 18:45:57,316 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#num~0.offset| Int) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19061 (Array Int Int)) (v_ArrVal_19055 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19038 (Array Int Int)) (v_ArrVal_19049 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19058 (Array Int Int)) (v_ArrVal_19046 (Array Int Int)) (v_ArrVal_19057 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19038) |c_~#__CS_thread_status~0.base| v_ArrVal_19055) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19043))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19061) |c_~#empty~0.base| v_ArrVal_19058) |c_~#full~0.base| v_ArrVal_19049) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19046) |c_~#__CS_thread_status~0.base| v_ArrVal_19057) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-19 18:45:57,354 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19061 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19055 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19038 (Array Int Int)) (v_ArrVal_19049 (Array Int Int)) (v_ArrVal_19037 (Array Int Int)) (v_ArrVal_19036 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19058 (Array Int Int)) (v_ArrVal_19046 (Array Int Int)) (v_ArrVal_19057 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19037) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19038) |c_~#__CS_thread_status~0.base| v_ArrVal_19055) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19043))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19061) |c_~#empty~0.base| v_ArrVal_19058) |c_~#full~0.base| v_ArrVal_19049) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19046) |c_~#__CS_thread_status~0.base| v_ArrVal_19057) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-19 18:45:57,383 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19061 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19034 (Array Int Int)) (v_ArrVal_19055 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19038 (Array Int Int)) (v_ArrVal_19049 (Array Int Int)) (v_ArrVal_19037 (Array Int Int)) (v_ArrVal_19036 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19058 (Array Int Int)) (v_ArrVal_19035 (Array Int Int)) (v_ArrVal_19046 (Array Int Int)) (v_ArrVal_19057 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19034) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19037) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19038) |c_~#__CS_thread_status~0.base| v_ArrVal_19055) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19043))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19061) |c_~#empty~0.base| v_ArrVal_19058) |c_~#full~0.base| v_ArrVal_19049) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19046) |c_~#__CS_thread_status~0.base| v_ArrVal_19057) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-19 18:45:57,408 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19030 (Array Int Int)) (v_ArrVal_19061 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19034 (Array Int Int)) (v_ArrVal_19033 (Array Int Int)) (v_ArrVal_19055 (Array Int Int)) (v_ArrVal_19032 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19031 (Array Int Int)) (v_ArrVal_19038 (Array Int Int)) (v_ArrVal_19049 (Array Int Int)) (v_ArrVal_19037 (Array Int Int)) (v_ArrVal_19036 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19058 (Array Int Int)) (v_ArrVal_19035 (Array Int Int)) (v_ArrVal_19046 (Array Int Int)) (v_ArrVal_19057 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_19030) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_19033) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_19031) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_19032) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19034) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19037) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19038) |c_~#__CS_thread_status~0.base| v_ArrVal_19055) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19043))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19061) |c_~#empty~0.base| v_ArrVal_19058) |c_~#full~0.base| v_ArrVal_19049) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19046) |c_~#__CS_thread_status~0.base| v_ArrVal_19057) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-19 18:45:57,489 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19030 (Array Int Int)) (v_ArrVal_19061 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_19029 (Array Int Int)) (v_ArrVal_19028 (Array Int Int)) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19034 (Array Int Int)) (v_ArrVal_19033 (Array Int Int)) (v_ArrVal_19055 (Array Int Int)) (v_ArrVal_19032 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19031 (Array Int Int)) (v_ArrVal_19038 (Array Int Int)) (v_ArrVal_19049 (Array Int Int)) (v_ArrVal_19037 (Array Int Int)) (v_ArrVal_19036 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19058 (Array Int Int)) (v_ArrVal_19035 (Array Int Int)) (v_ArrVal_19046 (Array Int Int)) (v_ArrVal_19057 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19029) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19028) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_19030) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_19033) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_19031) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_19032) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19034) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19037) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19038) |c_~#__CS_thread_status~0.base| v_ArrVal_19055) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19043))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19061) |c_~#empty~0.base| v_ArrVal_19058) |c_~#full~0.base| v_ArrVal_19049) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19046) |c_~#__CS_thread_status~0.base| v_ArrVal_19057) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-19 18:45:57,601 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19030 (Array Int Int)) (v_ArrVal_19061 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_19029 (Array Int Int)) (v_ArrVal_19028 (Array Int Int)) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19034 (Array Int Int)) (v_ArrVal_19033 (Array Int Int)) (v_ArrVal_19055 (Array Int Int)) (v_ArrVal_19032 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19031 (Array Int Int)) (v_ArrVal_19027 (Array Int Int)) (v_ArrVal_19038 (Array Int Int)) (v_ArrVal_19049 (Array Int Int)) (v_ArrVal_19026 (Array Int Int)) (v_ArrVal_19037 (Array Int Int)) (v_ArrVal_19036 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19058 (Array Int Int)) (v_ArrVal_19035 (Array Int Int)) (v_ArrVal_19046 (Array Int Int)) (v_ArrVal_19057 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19026) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19027) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19029) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19028) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_19030) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_19033) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_19031) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_19032) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19034) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19037) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19038) |c_~#__CS_thread_status~0.base| v_ArrVal_19055) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19043))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19061) |c_~#empty~0.base| v_ArrVal_19058) |c_~#full~0.base| v_ArrVal_19049) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19046) |c_~#__CS_thread_status~0.base| v_ArrVal_19057) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-19 18:45:57,653 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19030 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19034 (Array Int Int)) (v_ArrVal_19033 (Array Int Int)) (v_ArrVal_19055 (Array Int Int)) (v_ArrVal_19032 (Array Int Int)) (v_ArrVal_19031 (Array Int Int)) (v_ArrVal_19038 (Array Int Int)) (v_ArrVal_19037 (Array Int Int)) (v_ArrVal_19036 (Array Int Int)) (v_ArrVal_19058 (Array Int Int)) (v_ArrVal_19035 (Array Int Int)) (v_ArrVal_19057 (Array Int Int)) (v_ArrVal_19061 (Array Int Int)) (v_ArrVal_19029 (Array Int Int)) (v_ArrVal_19028 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19027 (Array Int Int)) (v_ArrVal_19049 (Array Int Int)) (v_ArrVal_19026 (Array Int Int)) (v_ArrVal_19025 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19024 (Array Int Int)) (v_ArrVal_19046 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19024) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19025) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19026) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19027) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19029) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19028) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_19030) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_19033) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_19031) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_19032) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19034) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19037) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19038) |c_~#__CS_thread_status~0.base| v_ArrVal_19055) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19043))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19061) |c_~#empty~0.base| v_ArrVal_19058) |c_~#full~0.base| v_ArrVal_19049) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19046) |c_~#__CS_thread_status~0.base| v_ArrVal_19057) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-19 18:45:57,699 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19030 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19034 (Array Int Int)) (v_ArrVal_19033 (Array Int Int)) (v_ArrVal_19055 (Array Int Int)) (v_ArrVal_19032 (Array Int Int)) (v_ArrVal_19031 (Array Int Int)) (v_ArrVal_19038 (Array Int Int)) (v_ArrVal_19037 (Array Int Int)) (v_ArrVal_19036 (Array Int Int)) (v_ArrVal_19058 (Array Int Int)) (v_ArrVal_19035 (Array Int Int)) (v_ArrVal_19057 (Array Int Int)) (v_ArrVal_19061 (Array Int Int)) (v_ArrVal_19029 (Array Int Int)) (v_ArrVal_19028 (Array Int Int)) (v_ArrVal_19023 (Array Int Int)) (v_ArrVal_19022 (Array Int Int)) (v_ArrVal_19021 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19020 (Array Int Int)) (v_ArrVal_19027 (Array Int Int)) (v_ArrVal_19049 (Array Int Int)) (v_ArrVal_19026 (Array Int Int)) (v_ArrVal_19025 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19024 (Array Int Int)) (v_ArrVal_19046 (Array Int Int))) (not (= 1 (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_19020) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_19023) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_19021) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_19022) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19024) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19025) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19026) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19027) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19029) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19028) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_19030) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_19033) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_19031) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_19032) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19034) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19037) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19038) |c_~#__CS_thread_status~0.base| v_ArrVal_19055) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19043))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19061) |c_~#empty~0.base| v_ArrVal_19058) |c_~#full~0.base| v_ArrVal_19049) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19046) |c_~#__CS_thread_status~0.base| v_ArrVal_19057) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256)))) is different from false [2022-07-19 18:45:57,861 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 854 trivial. 47 not checked. [2022-07-19 18:45:57,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38196654] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 18:45:57,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 18:45:57,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 15] total 33 [2022-07-19 18:45:57,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516263929] [2022-07-19 18:45:57,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 18:45:57,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-19 18:45:57,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:45:57,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-19 18:45:57,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=455, Unknown=9, NotChecked=468, Total=1056 [2022-07-19 18:45:57,863 INFO L87 Difference]: Start difference. First operand 1440 states and 2257 transitions. Second operand has 33 states, 33 states have (on average 5.333333333333333) internal successors, (176), 29 states have internal predecessors, (176), 9 states have call successors, (50), 9 states have call predecessors, (50), 6 states have return successors, (44), 9 states have call predecessors, (44), 9 states have call successors, (44) [2022-07-19 18:46:00,199 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:46:01,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:46:01,761 INFO L93 Difference]: Finished difference Result 2292 states and 3433 transitions. [2022-07-19 18:46:01,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 18:46:01,762 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 5.333333333333333) internal successors, (176), 29 states have internal predecessors, (176), 9 states have call successors, (50), 9 states have call predecessors, (50), 6 states have return successors, (44), 9 states have call predecessors, (44), 9 states have call successors, (44) Word has length 221 [2022-07-19 18:46:01,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:46:01,771 INFO L225 Difference]: With dead ends: 2292 [2022-07-19 18:46:01,771 INFO L226 Difference]: Without dead ends: 1626 [2022-07-19 18:46:01,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 486 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=276, Invalid=1083, Unknown=9, NotChecked=702, Total=2070 [2022-07-19 18:46:01,775 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 453 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 354 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 5006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 3177 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-19 18:46:01,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1125 Invalid, 5006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 1474 Invalid, 1 Unknown, 3177 Unchecked, 3.2s Time] [2022-07-19 18:46:01,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2022-07-19 18:46:01,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1552. [2022-07-19 18:46:01,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1074 states have (on average 1.266294227188082) internal successors, (1360), 986 states have internal predecessors, (1360), 353 states have call successors, (353), 69 states have call predecessors, (353), 124 states have return successors, (693), 496 states have call predecessors, (693), 353 states have call successors, (693) [2022-07-19 18:46:01,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2406 transitions. [2022-07-19 18:46:01,877 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2406 transitions. Word has length 221 [2022-07-19 18:46:01,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:46:01,878 INFO L495 AbstractCegarLoop]: Abstraction has 1552 states and 2406 transitions. [2022-07-19 18:46:01,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.333333333333333) internal successors, (176), 29 states have internal predecessors, (176), 9 states have call successors, (50), 9 states have call predecessors, (50), 6 states have return successors, (44), 9 states have call predecessors, (44), 9 states have call successors, (44) [2022-07-19 18:46:01,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2406 transitions. [2022-07-19 18:46:01,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-07-19 18:46:01,884 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:46:01,884 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:46:01,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-19 18:46:02,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:46:02,098 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:46:02,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:46:02,098 INFO L85 PathProgramCache]: Analyzing trace with hash 857070716, now seen corresponding path program 1 times [2022-07-19 18:46:02,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:46:02,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913380373] [2022-07-19 18:46:02,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:46:02,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:46:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 18:46:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 18:46:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:46:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:46:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 18:46:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 18:46:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:46:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:46:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 18:46:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 18:46:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:46:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:46:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 18:46:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:46:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:46:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 18:46:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 18:46:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:46:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:46:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-19 18:46:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-19 18:46:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-19 18:46:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-19 18:46:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-19 18:46:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-19 18:46:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-19 18:46:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-19 18:46:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-19 18:46:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-19 18:46:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:10,791 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2022-07-19 18:46:10,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:46:10,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913380373] [2022-07-19 18:46:10,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913380373] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:46:10,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302918752] [2022-07-19 18:46:10,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:46:10,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:46:10,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:46:10,793 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:46:10,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-19 18:46:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:11,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 2479 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 18:46:11,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:46:11,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 18:46:11,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 18:46:11,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:11,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:12,002 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2022-07-19 18:46:12,003 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 18:46:12,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302918752] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:46:12,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 18:46:12,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 8 [2022-07-19 18:46:12,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017617428] [2022-07-19 18:46:12,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:46:12,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 18:46:12,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:46:12,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 18:46:12,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-19 18:46:12,004 INFO L87 Difference]: Start difference. First operand 1552 states and 2406 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-19 18:46:12,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:46:12,192 INFO L93 Difference]: Finished difference Result 3135 states and 4822 transitions. [2022-07-19 18:46:12,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 18:46:12,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 222 [2022-07-19 18:46:12,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:46:12,202 INFO L225 Difference]: With dead ends: 3135 [2022-07-19 18:46:12,203 INFO L226 Difference]: Without dead ends: 1600 [2022-07-19 18:46:12,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-19 18:46:12,209 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 335 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 18:46:12,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 904 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 18:46:12,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2022-07-19 18:46:12,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1531. [2022-07-19 18:46:12,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 1059 states have (on average 1.267233238904627) internal successors, (1342), 972 states have internal predecessors, (1342), 350 states have call successors, (350), 67 states have call predecessors, (350), 121 states have return successors, (685), 491 states have call predecessors, (685), 350 states have call successors, (685) [2022-07-19 18:46:12,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 2377 transitions. [2022-07-19 18:46:12,310 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 2377 transitions. Word has length 222 [2022-07-19 18:46:12,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:46:12,310 INFO L495 AbstractCegarLoop]: Abstraction has 1531 states and 2377 transitions. [2022-07-19 18:46:12,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-19 18:46:12,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2377 transitions. [2022-07-19 18:46:12,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-19 18:46:12,315 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:46:12,315 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:46:12,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-19 18:46:12,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-19 18:46:12,539 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:46:12,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:46:12,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1032257057, now seen corresponding path program 1 times [2022-07-19 18:46:12,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:46:12,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932531213] [2022-07-19 18:46:12,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:46:12,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:46:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 18:46:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 18:46:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:46:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:46:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 18:46:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 18:46:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:46:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:46:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 18:46:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 18:46:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:46:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:46:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 18:46:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:46:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:46:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 18:46:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 18:46:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:46:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 18:46:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-19 18:46:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-19 18:46:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-19 18:46:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-19 18:46:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-19 18:46:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-19 18:46:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-19 18:46:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-19 18:46:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-19 18:46:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-19 18:46:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:34,913 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2022-07-19 18:46:34,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:46:34,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932531213] [2022-07-19 18:46:34,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932531213] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:46:34,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782451454] [2022-07-19 18:46:34,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:46:34,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:46:34,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:46:34,915 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:46:34,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-19 18:46:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:36,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 2510 conjuncts, 156 conjunts are in the unsatisfiable core [2022-07-19 18:46:36,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:46:36,708 INFO L356 Elim1Store]: treesize reduction 120, result has 25.5 percent of original size [2022-07-19 18:46:36,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 88 treesize of output 114 [2022-07-19 18:46:36,916 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-19 18:46:36,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 19 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 51 [2022-07-19 18:46:36,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:36,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-19 18:46:37,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2022-07-19 18:46:37,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2022-07-19 18:46:37,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2022-07-19 18:46:38,381 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-19 18:46:38,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 19 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 59 [2022-07-19 18:46:38,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2022-07-19 18:46:38,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2022-07-19 18:46:38,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 49 [2022-07-19 18:46:38,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2022-07-19 18:46:39,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:39,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:39,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:39,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:39,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:39,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:39,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:39,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:39,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:39,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:39,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:39,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:39,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:39,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:39,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:39,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:39,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:39,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:39,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:39,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:39,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:39,455 INFO L356 Elim1Store]: treesize reduction 618, result has 10.7 percent of original size [2022-07-19 18:46:39,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 27 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 467 treesize of output 608 [2022-07-19 18:46:39,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-19 18:46:40,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-19 18:46:40,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-19 18:46:40,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-19 18:46:40,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-19 18:46:40,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-19 18:46:40,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-19 18:46:40,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:40,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:41,065 INFO L356 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-07-19 18:46:41,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 8 select indices, 8 select index equivalence classes, 27 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 5 case distinctions, treesize of input 416 treesize of output 444 [2022-07-19 18:46:41,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:41,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:41,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:41,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:41,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:41,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:41,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:41,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:41,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:41,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:41,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:41,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:41,305 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-19 18:46:41,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 27 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 41 [2022-07-19 18:46:51,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:51,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:51,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:51,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 3513 treesize of output 3259 [2022-07-19 18:47:05,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:47:05,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:47:05,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:47:05,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 356 treesize of output 336 [2022-07-19 18:47:11,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:47:11,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:47:11,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:47:11,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 255 treesize of output 241 [2022-07-19 18:47:11,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:47:11,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2022-07-19 18:47:18,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:47:18,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:47:18,823 INFO L356 Elim1Store]: treesize reduction 632, result has 1.1 percent of original size [2022-07-19 18:47:18,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 14 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 16 new quantified variables, introduced 14 case distinctions, treesize of input 3414 treesize of output 4496