/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-01 15:52:08,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-01 15:52:08,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-01 15:52:08,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-01 15:52:08,311 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-01 15:52:08,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-01 15:52:08,312 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-01 15:52:08,313 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-01 15:52:08,314 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-01 15:52:08,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-01 15:52:08,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-01 15:52:08,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-01 15:52:08,316 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-01 15:52:08,317 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-01 15:52:08,318 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-01 15:52:08,318 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-01 15:52:08,319 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-01 15:52:08,319 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-01 15:52:08,320 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-01 15:52:08,321 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-01 15:52:08,322 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-01 15:52:08,324 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-01 15:52:08,325 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-01 15:52:08,325 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-01 15:52:08,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-01 15:52:08,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-01 15:52:08,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-01 15:52:08,327 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-01 15:52:08,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-01 15:52:08,328 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-01 15:52:08,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-01 15:52:08,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-01 15:52:08,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-01 15:52:08,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-01 15:52:08,330 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-01 15:52:08,330 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-01 15:52:08,330 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-01 15:52:08,331 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-01 15:52:08,331 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-01 15:52:08,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-01 15:52:08,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-01 15:52:08,332 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-01 15:52:08,347 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-01 15:52:08,347 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-01 15:52:08,348 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-01 15:52:08,348 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-01 15:52:08,348 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-01 15:52:08,348 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-01 15:52:08,349 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-01 15:52:08,349 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-01 15:52:08,349 INFO L138 SettingsManager]: * Use SBE=true [2022-03-01 15:52:08,349 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-01 15:52:08,349 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-01 15:52:08,349 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-01 15:52:08,349 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-01 15:52:08,349 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-01 15:52:08,349 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-01 15:52:08,349 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-01 15:52:08,349 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-01 15:52:08,349 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-01 15:52:08,350 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-01 15:52:08,350 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-01 15:52:08,350 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-01 15:52:08,350 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-01 15:52:08,350 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-01 15:52:08,350 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-01 15:52:08,350 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-01 15:52:08,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 15:52:08,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-01 15:52:08,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-01 15:52:08,350 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-01 15:52:08,351 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-01 15:52:08,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-01 15:52:08,351 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-01 15:52:08,351 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-01 15:52:08,351 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 [2022-03-01 15:52:08,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-01 15:52:08,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-01 15:52:08,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-01 15:52:08,493 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-01 15:52:08,494 INFO L275 PluginConnector]: CDTParser initialized [2022-03-01 15:52:08,494 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2022-03-01 15:52:08,546 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/912e1f390/7a39b49295924dbbab0386187d33edba/FLAG6504db3ac [2022-03-01 15:52:08,897 INFO L306 CDTParser]: Found 1 translation units. [2022-03-01 15:52:08,897 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2022-03-01 15:52:08,915 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/912e1f390/7a39b49295924dbbab0386187d33edba/FLAG6504db3ac [2022-03-01 15:52:08,924 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/912e1f390/7a39b49295924dbbab0386187d33edba [2022-03-01 15:52:08,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-01 15:52:08,931 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-01 15:52:08,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-01 15:52:08,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-01 15:52:08,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-01 15:52:08,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 03:52:08" (1/1) ... [2022-03-01 15:52:08,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f1e6e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:52:08, skipping insertion in model container [2022-03-01 15:52:08,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 03:52:08" (1/1) ... [2022-03-01 15:52:08,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-01 15:52:08,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-01 15:52:09,140 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c[3018,3031] [2022-03-01 15:52:09,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 15:52:09,149 INFO L203 MainTranslator]: Completed pre-run [2022-03-01 15:52:09,164 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c[3018,3031] [2022-03-01 15:52:09,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 15:52:09,175 INFO L208 MainTranslator]: Completed translation [2022-03-01 15:52:09,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:52:09 WrapperNode [2022-03-01 15:52:09,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-01 15:52:09,176 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-01 15:52:09,176 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-01 15:52:09,176 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-01 15:52:09,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:52:09" (1/1) ... [2022-03-01 15:52:09,187 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:52:09" (1/1) ... [2022-03-01 15:52:09,202 INFO L137 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2022-03-01 15:52:09,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-01 15:52:09,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-01 15:52:09,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-01 15:52:09,203 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-01 15:52:09,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:52:09" (1/1) ... [2022-03-01 15:52:09,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:52:09" (1/1) ... [2022-03-01 15:52:09,217 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:52:09" (1/1) ... [2022-03-01 15:52:09,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:52:09" (1/1) ... [2022-03-01 15:52:09,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:52:09" (1/1) ... [2022-03-01 15:52:09,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:52:09" (1/1) ... [2022-03-01 15:52:09,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:52:09" (1/1) ... [2022-03-01 15:52:09,230 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-01 15:52:09,231 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-01 15:52:09,231 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-01 15:52:09,231 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-01 15:52:09,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:52:09" (1/1) ... [2022-03-01 15:52:09,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 15:52:09,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:52:09,259 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-03-01 15:52:09,271 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-03-01 15:52:09,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-01 15:52:09,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-01 15:52:09,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-01 15:52:09,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-01 15:52:09,285 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-01 15:52:09,286 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-01 15:52:09,286 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-01 15:52:09,286 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-01 15:52:09,286 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-01 15:52:09,286 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-01 15:52:09,286 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-01 15:52:09,286 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-01 15:52:09,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-01 15:52:09,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-01 15:52:09,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-01 15:52:09,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-01 15:52:09,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-01 15:52:09,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-01 15:52:09,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-01 15:52:09,287 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-01 15:52:09,346 INFO L234 CfgBuilder]: Building ICFG [2022-03-01 15:52:09,347 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-01 15:52:09,584 INFO L275 CfgBuilder]: Performing block encoding [2022-03-01 15:52:09,627 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-01 15:52:09,627 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-01 15:52:09,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 03:52:09 BoogieIcfgContainer [2022-03-01 15:52:09,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-01 15:52:09,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-01 15:52:09,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-01 15:52:09,632 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-01 15:52:09,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.03 03:52:08" (1/3) ... [2022-03-01 15:52:09,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@377ccd62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 03:52:09, skipping insertion in model container [2022-03-01 15:52:09,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:52:09" (2/3) ... [2022-03-01 15:52:09,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@377ccd62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 03:52:09, skipping insertion in model container [2022-03-01 15:52:09,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 03:52:09" (3/3) ... [2022-03-01 15:52:09,634 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-min-max-inc.wvr.c [2022-03-01 15:52:09,637 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-01 15:52:09,637 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-01 15:52:09,637 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-01 15:52:09,637 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-01 15:52:09,666 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,667 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,667 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,667 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,667 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,668 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,668 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,668 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,668 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,668 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,668 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,668 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,669 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,669 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,669 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,669 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,669 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,669 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,670 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,670 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,670 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,670 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,670 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,670 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,670 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,671 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,671 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,671 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,671 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,671 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,671 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,671 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,672 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,672 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,672 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,672 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,672 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,672 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,672 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,673 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,673 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,673 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,673 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,673 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,673 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,673 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,673 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,673 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,673 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,674 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,674 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,674 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,674 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,674 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,675 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,675 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,675 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,675 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,675 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,675 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,675 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,675 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,676 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,676 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,676 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,676 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,676 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,676 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,676 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,677 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,677 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,677 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,677 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,677 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,677 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,677 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,677 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,677 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,677 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,678 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,678 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,678 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,678 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,678 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,678 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,678 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,679 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,679 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,679 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,679 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,679 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,679 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,679 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,679 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,680 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,680 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,680 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,680 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,680 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,680 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,683 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,683 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,683 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,683 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,683 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,683 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,683 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,684 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,684 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,684 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,685 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,685 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,685 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,685 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,685 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,685 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,685 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,685 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,686 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,686 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,686 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,686 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,686 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,686 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,686 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,686 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,686 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:52:09,690 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-03-01 15:52:09,717 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-01 15:52:09,723 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-01 15:52:09,724 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-01 15:52:09,738 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 173 places, 172 transitions, 376 flow [2022-03-01 15:52:10,624 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 26140 states, 26139 states have (on average 4.557289873369295) internal successors, (119123), 26139 states have internal predecessors, (119123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:10,745 INFO L276 IsEmpty]: Start isEmpty. Operand has 26140 states, 26139 states have (on average 4.557289873369295) internal successors, (119123), 26139 states have internal predecessors, (119123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:11,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-03-01 15:52:11,003 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:52:11,003 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-01 15:52:11,004 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:52:11,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:52:11,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1420994164, now seen corresponding path program 1 times [2022-03-01 15:52:11,018 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:52:11,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107719934] [2022-03-01 15:52:11,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:52:11,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:52:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:52:11,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:52:11,224 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:52:11,225 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107719934] [2022-03-01 15:52:11,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107719934] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:52:11,225 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:52:11,225 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-01 15:52:11,226 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569448725] [2022-03-01 15:52:11,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:52:11,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-01 15:52:11,232 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:52:11,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-01 15:52:11,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-01 15:52:11,303 INFO L87 Difference]: Start difference. First operand has 26140 states, 26139 states have (on average 4.557289873369295) internal successors, (119123), 26139 states have internal predecessors, (119123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 60.5) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:11,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:52:11,702 INFO L93 Difference]: Finished difference Result 26140 states and 111710 transitions. [2022-03-01 15:52:11,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 15:52:11,704 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 60.5) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-03-01 15:52:11,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:52:11,980 INFO L225 Difference]: With dead ends: 26140 [2022-03-01 15:52:11,980 INFO L226 Difference]: Without dead ends: 26136 [2022-03-01 15:52:11,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-01 15:52:11,984 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 15:52:11,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 15:52:12,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26136 states. [2022-03-01 15:52:12,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26136 to 26136. [2022-03-01 15:52:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26136 states, 26135 states have (on average 4.274191696958102) internal successors, (111706), 26135 states have internal predecessors, (111706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:13,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26136 states to 26136 states and 111706 transitions. [2022-03-01 15:52:13,189 INFO L78 Accepts]: Start accepts. Automaton has 26136 states and 111706 transitions. Word has length 121 [2022-03-01 15:52:13,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:52:13,189 INFO L470 AbstractCegarLoop]: Abstraction has 26136 states and 111706 transitions. [2022-03-01 15:52:13,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 60.5) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:13,189 INFO L276 IsEmpty]: Start isEmpty. Operand 26136 states and 111706 transitions. [2022-03-01 15:52:13,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-03-01 15:52:13,306 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:52:13,306 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-01 15:52:13,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-01 15:52:13,306 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:52:13,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:52:13,308 INFO L85 PathProgramCache]: Analyzing trace with hash -507464182, now seen corresponding path program 1 times [2022-03-01 15:52:13,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:52:13,309 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154552918] [2022-03-01 15:52:13,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:52:13,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:52:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:52:13,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:52:13,709 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:52:13,709 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154552918] [2022-03-01 15:52:13,709 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154552918] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:52:13,709 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:52:13,710 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-01 15:52:13,710 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935180701] [2022-03-01 15:52:13,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:52:13,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 15:52:13,711 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:52:13,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 15:52:13,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-03-01 15:52:13,712 INFO L87 Difference]: Start difference. First operand 26136 states and 111706 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:14,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:52:14,306 INFO L93 Difference]: Finished difference Result 35136 states and 150562 transitions. [2022-03-01 15:52:14,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 15:52:14,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-03-01 15:52:14,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:52:14,577 INFO L225 Difference]: With dead ends: 35136 [2022-03-01 15:52:14,578 INFO L226 Difference]: Without dead ends: 35136 [2022-03-01 15:52:14,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-03-01 15:52:14,580 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 352 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:52:14,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 319 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 15:52:14,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35136 states. [2022-03-01 15:52:15,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35136 to 28386. [2022-03-01 15:52:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28386 states, 28385 states have (on average 4.277611414479479) internal successors, (121420), 28385 states have internal predecessors, (121420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:15,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28386 states to 28386 states and 121420 transitions. [2022-03-01 15:52:15,797 INFO L78 Accepts]: Start accepts. Automaton has 28386 states and 121420 transitions. Word has length 121 [2022-03-01 15:52:15,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:52:15,797 INFO L470 AbstractCegarLoop]: Abstraction has 28386 states and 121420 transitions. [2022-03-01 15:52:15,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:15,797 INFO L276 IsEmpty]: Start isEmpty. Operand 28386 states and 121420 transitions. [2022-03-01 15:52:16,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-03-01 15:52:16,015 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:52:16,015 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-01 15:52:16,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-01 15:52:16,016 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:52:16,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:52:16,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1313580435, now seen corresponding path program 1 times [2022-03-01 15:52:16,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:52:16,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572093952] [2022-03-01 15:52:16,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:52:16,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:52:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:52:16,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:52:16,122 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:52:16,122 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572093952] [2022-03-01 15:52:16,122 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572093952] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:52:16,122 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:52:16,122 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-01 15:52:16,122 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483376983] [2022-03-01 15:52:16,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:52:16,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-01 15:52:16,123 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:52:16,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-01 15:52:16,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-01 15:52:16,123 INFO L87 Difference]: Start difference. First operand 28386 states and 121420 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:16,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:52:16,582 INFO L93 Difference]: Finished difference Result 37401 states and 158042 transitions. [2022-03-01 15:52:16,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-01 15:52:16,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2022-03-01 15:52:16,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:52:16,720 INFO L225 Difference]: With dead ends: 37401 [2022-03-01 15:52:16,720 INFO L226 Difference]: Without dead ends: 28392 [2022-03-01 15:52:16,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-03-01 15:52:16,726 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 425 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:52:16,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [425 Valid, 475 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 15:52:16,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28392 states. [2022-03-01 15:52:17,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28392 to 28387. [2022-03-01 15:52:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28387 states, 28386 states have (on average 4.277495948707109) internal successors, (121421), 28386 states have internal predecessors, (121421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:17,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28387 states to 28387 states and 121421 transitions. [2022-03-01 15:52:17,691 INFO L78 Accepts]: Start accepts. Automaton has 28387 states and 121421 transitions. Word has length 126 [2022-03-01 15:52:17,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:52:17,691 INFO L470 AbstractCegarLoop]: Abstraction has 28387 states and 121421 transitions. [2022-03-01 15:52:17,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:17,692 INFO L276 IsEmpty]: Start isEmpty. Operand 28387 states and 121421 transitions. [2022-03-01 15:52:17,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-01 15:52:17,765 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:52:17,765 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-01 15:52:17,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-01 15:52:17,765 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:52:17,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:52:17,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1766570838, now seen corresponding path program 1 times [2022-03-01 15:52:17,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:52:17,766 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088563723] [2022-03-01 15:52:17,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:52:17,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:52:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:52:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:52:17,889 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:52:17,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088563723] [2022-03-01 15:52:17,890 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088563723] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:52:17,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412285281] [2022-03-01 15:52:17,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:52:17,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:52:17,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:52:17,891 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-03-01 15:52:17,892 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-03-01 15:52:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:52:17,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-01 15:52:17,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:52:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:52:18,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:52:18,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:52:18,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412285281] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 15:52:18,702 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 15:52:18,703 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-03-01 15:52:18,704 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14812274] [2022-03-01 15:52:18,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:52:18,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-01 15:52:18,705 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:52:18,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-01 15:52:18,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-03-01 15:52:18,706 INFO L87 Difference]: Start difference. First operand 28387 states and 121421 transitions. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:19,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:52:19,011 INFO L93 Difference]: Finished difference Result 30943 states and 132410 transitions. [2022-03-01 15:52:19,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-01 15:52:19,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-03-01 15:52:19,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:52:19,259 INFO L225 Difference]: With dead ends: 30943 [2022-03-01 15:52:19,259 INFO L226 Difference]: Without dead ends: 30943 [2022-03-01 15:52:19,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 258 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-03-01 15:52:19,260 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 280 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:52:19,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 368 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 15:52:19,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30943 states. [2022-03-01 15:52:19,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30943 to 30943. [2022-03-01 15:52:20,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30943 states, 30942 states have (on average 4.279296748755737) internal successors, (132410), 30942 states have internal predecessors, (132410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:20,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30943 states to 30943 states and 132410 transitions. [2022-03-01 15:52:20,291 INFO L78 Accepts]: Start accepts. Automaton has 30943 states and 132410 transitions. Word has length 133 [2022-03-01 15:52:20,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:52:20,308 INFO L470 AbstractCegarLoop]: Abstraction has 30943 states and 132410 transitions. [2022-03-01 15:52:20,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:20,309 INFO L276 IsEmpty]: Start isEmpty. Operand 30943 states and 132410 transitions. [2022-03-01 15:52:20,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-03-01 15:52:20,434 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:52:20,435 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-01 15:52:20,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-01 15:52:20,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:52:20,636 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:52:20,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:52:20,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1027911653, now seen corresponding path program 1 times [2022-03-01 15:52:20,636 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:52:20,636 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224224597] [2022-03-01 15:52:20,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:52:20,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:52:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:52:20,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:52:20,734 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:52:20,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224224597] [2022-03-01 15:52:20,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224224597] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:52:20,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311417883] [2022-03-01 15:52:20,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:52:20,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:52:20,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:52:20,740 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-03-01 15:52:20,767 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-03-01 15:52:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:52:20,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-01 15:52:20,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:52:21,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:52:21,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:52:21,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:52:21,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311417883] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 15:52:21,265 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 15:52:21,266 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-03-01 15:52:21,266 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845998131] [2022-03-01 15:52:21,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:52:21,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-01 15:52:21,266 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:52:21,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-01 15:52:21,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-03-01 15:52:21,267 INFO L87 Difference]: Start difference. First operand 30943 states and 132410 transitions. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:21,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:52:21,721 INFO L93 Difference]: Finished difference Result 34267 states and 146807 transitions. [2022-03-01 15:52:21,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-01 15:52:21,722 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2022-03-01 15:52:21,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:52:21,868 INFO L225 Difference]: With dead ends: 34267 [2022-03-01 15:52:21,869 INFO L226 Difference]: Without dead ends: 34267 [2022-03-01 15:52:21,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 268 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-03-01 15:52:21,869 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 240 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 15:52:21,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 410 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 15:52:21,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34267 states. [2022-03-01 15:52:22,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34267 to 34267. [2022-03-01 15:52:22,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34267 states, 34266 states have (on average 4.284334325570536) internal successors, (146807), 34266 states have internal predecessors, (146807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:22,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34267 states to 34267 states and 146807 transitions. [2022-03-01 15:52:22,991 INFO L78 Accepts]: Start accepts. Automaton has 34267 states and 146807 transitions. Word has length 138 [2022-03-01 15:52:22,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:52:22,991 INFO L470 AbstractCegarLoop]: Abstraction has 34267 states and 146807 transitions. [2022-03-01 15:52:22,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:22,991 INFO L276 IsEmpty]: Start isEmpty. Operand 34267 states and 146807 transitions. [2022-03-01 15:52:23,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-01 15:52:23,074 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:52:23,075 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-01 15:52:23,091 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-03-01 15:52:23,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:52:23,280 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:52:23,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:52:23,280 INFO L85 PathProgramCache]: Analyzing trace with hash 334563494, now seen corresponding path program 1 times [2022-03-01 15:52:23,280 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:52:23,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3948693] [2022-03-01 15:52:23,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:52:23,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:52:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:52:23,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:52:23,535 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:52:23,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3948693] [2022-03-01 15:52:23,535 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3948693] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:52:23,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358472367] [2022-03-01 15:52:23,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:52:23,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:52:23,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:52:23,536 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-03-01 15:52:23,538 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-03-01 15:52:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:52:23,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-01 15:52:23,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:52:24,146 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-03-01 15:52:24,251 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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-03-01 15:52:24,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:52:24,443 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2022-03-01 15:52:24,455 INFO L387 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 15 treesize of output 7 [2022-03-01 15:52:24,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:52:24,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:52:24,811 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))) is different from false [2022-03-01 15:52:24,963 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (and (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))))) (<= c_~min~0 (+ .cse0 1))) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse1) (<= .cse1 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1)))))) (<= 2147483647 .cse0)))) is different from false [2022-03-01 15:52:25,199 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse2 (select |c_#memory_int| c_~A~0.base))) (let ((.cse1 (select .cse2 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (<= .cse1 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1)) (< (select .cse2 c_~A~0.offset) .cse1))))) (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (<= (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset)))) (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (+ .cse0 1))))))) is different from false [2022-03-01 15:52:25,276 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse1 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (and (or (<= (select (select .cse0 c_~A~0.base) c_~A~0.offset) (+ .cse1 1)) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (<= (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 2))))) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse3 (select .cse5 c_~A~0.base))) (let ((.cse4 (select .cse3 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< (select .cse3 c_~A~0.offset) .cse4) (<= .cse4 (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1)))))))) (<= 2147483647 .cse1))))) is different from false [2022-03-01 15:52:25,439 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse5 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|))) (or (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_#t~ret16#1.base|))) (let ((.cse1 (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret16#1.offset| (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< (select .cse0 |c_ULTIMATE.start_main_#t~ret16#1.offset|) .cse1) (<= .cse1 (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|) 1))))))) (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (<= (select (select .cse3 |c_ULTIMATE.start_main_#t~ret16#1.base|) (+ |c_ULTIMATE.start_main_#t~ret16#1.offset| (* thread1Thread1of1ForFork0_~i~0 4))) (+ 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|))))) (<= (select (select .cse4 |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|) (+ .cse5 1)))) (<= 2147483647 .cse5))))) is different from false [2022-03-01 15:52:25,519 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (<= 2147483647 .cse0) (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse1 (select .cse3 (+ (* thread1Thread1of1ForFork0_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (<= .cse1 (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 1)) (< (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) .cse1)))))) (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (<= (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* thread1Thread1of1ForFork0_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 2)))) (<= (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (+ .cse0 1)))))))) is different from false [2022-03-01 15:52:25,557 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (and (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (<= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* thread1Thread1of1ForFork0_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2)))) (<= (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse2 1))) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse3 (select .cse5 (+ (* thread1Thread1of1ForFork0_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= .cse3 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (< (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse3))))))) (<= 2147483647 .cse2))))) is different from false [2022-03-01 15:52:25,829 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:52:25,829 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 220 treesize of output 124 [2022-03-01 15:52:25,850 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:52:25,850 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1183 treesize of output 1011 [2022-03-01 15:52:25,890 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:52:25,891 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 515 treesize of output 471 [2022-03-01 15:52:25,902 INFO L387 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 483 treesize of output 443 [2022-03-01 15:52:26,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-03-01 15:52:26,248 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358472367] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:52:26,248 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:52:26,248 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 38 [2022-03-01 15:52:26,248 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003798492] [2022-03-01 15:52:26,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:52:26,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-01 15:52:26,250 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:52:26,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-01 15:52:26,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=846, Unknown=7, NotChecked=448, Total=1406 [2022-03-01 15:52:26,251 INFO L87 Difference]: Start difference. First operand 34267 states and 146807 transitions. Second operand has 38 states, 38 states have (on average 9.789473684210526) internal successors, (372), 38 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:29,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:52:29,130 INFO L93 Difference]: Finished difference Result 182723 states and 790142 transitions. [2022-03-01 15:52:29,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-01 15:52:29,130 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 9.789473684210526) internal successors, (372), 38 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-03-01 15:52:29,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:52:29,586 INFO L225 Difference]: With dead ends: 182723 [2022-03-01 15:52:29,586 INFO L226 Difference]: Without dead ends: 94065 [2022-03-01 15:52:29,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 266 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=765, Invalid=2796, Unknown=7, NotChecked=854, Total=4422 [2022-03-01 15:52:29,587 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 1940 mSDsluCounter, 4155 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1940 SdHoareTripleChecker+Valid, 4126 SdHoareTripleChecker+Invalid, 5053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3602 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 15:52:29,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1940 Valid, 4126 Invalid, 5053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1343 Invalid, 0 Unknown, 3602 Unchecked, 0.6s Time] [2022-03-01 15:52:29,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94065 states. [2022-03-01 15:52:31,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94065 to 35288. [2022-03-01 15:52:31,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35288 states, 35287 states have (on average 4.248703488536855) internal successors, (149924), 35287 states have internal predecessors, (149924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:32,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35288 states to 35288 states and 149924 transitions. [2022-03-01 15:52:32,313 INFO L78 Accepts]: Start accepts. Automaton has 35288 states and 149924 transitions. Word has length 143 [2022-03-01 15:52:32,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:52:32,314 INFO L470 AbstractCegarLoop]: Abstraction has 35288 states and 149924 transitions. [2022-03-01 15:52:32,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 9.789473684210526) internal successors, (372), 38 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:32,314 INFO L276 IsEmpty]: Start isEmpty. Operand 35288 states and 149924 transitions. [2022-03-01 15:52:32,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-01 15:52:32,467 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:52:32,467 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-01 15:52:32,484 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-03-01 15:52:32,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:52:32,671 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:52:32,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:52:32,671 INFO L85 PathProgramCache]: Analyzing trace with hash 940179670, now seen corresponding path program 2 times [2022-03-01 15:52:32,671 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:52:32,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597230434] [2022-03-01 15:52:32,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:52:32,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:52:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:52:33,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:52:33,012 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:52:33,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597230434] [2022-03-01 15:52:33,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597230434] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:52:33,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357814032] [2022-03-01 15:52:33,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 15:52:33,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:52:33,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:52:33,014 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-03-01 15:52:33,015 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-03-01 15:52:33,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 15:52:33,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:52:33,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-01 15:52:33,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:52:33,136 INFO L387 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-03-01 15:52:33,155 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-01 15:52:33,156 INFO L387 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 12 treesize of output 14 [2022-03-01 15:52:33,198 INFO L353 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-03-01 15:52:33,198 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-03-01 15:52:33,367 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-01 15:52:33,367 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:52:33,579 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-01 15:52:33,623 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2022-03-01 15:52:33,641 INFO L387 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 15 treesize of output 7 [2022-03-01 15:52:33,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:52:33,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:52:33,930 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_231 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_231) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))) is different from false [2022-03-01 15:52:33,967 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_230 (Array Int Int)) (v_ArrVal_231 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_230) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_231) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))) is different from false [2022-03-01 15:52:34,064 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_230 (Array Int Int)) (v_ArrVal_231 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_230) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_231) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse1 (< c_~min~0 .cse3)) (.cse2 (+ .cse0 1))) (and (or (not .cse1) (<= c_~min~0 .cse2)) (or .cse1 (<= .cse3 .cse2)))))))) is different from false [2022-03-01 15:52:34,109 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_230 (Array Int Int)) (v_ArrVal_231 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_230) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_231) c_~A~0.base) c_~A~0.offset))) (or (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse0 (< c_~min~0 .cse1)) (.cse2 (+ .cse3 1))) (and (or .cse0 (<= .cse1 .cse2)) (or (not .cse0) (<= c_~min~0 .cse2))))) (<= 2147483647 .cse3)))) is different from false [2022-03-01 15:52:34,135 INFO L387 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 247 treesize of output 215 [2022-03-01 15:52:34,141 INFO L387 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 105 treesize of output 97 [2022-03-01 15:52:34,144 INFO L387 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 199 treesize of output 183 [2022-03-01 15:52:34,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-03-01 15:52:34,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357814032] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:52:34,803 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:52:34,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 20] total 37 [2022-03-01 15:52:34,803 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398222229] [2022-03-01 15:52:34,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:52:34,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-01 15:52:34,804 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:52:34,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-01 15:52:34,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=942, Unknown=4, NotChecked=260, Total=1332 [2022-03-01 15:52:34,805 INFO L87 Difference]: Start difference. First operand 35288 states and 149924 transitions. Second operand has 37 states, 37 states have (on average 9.108108108108109) internal successors, (337), 37 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:37,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:52:37,902 INFO L93 Difference]: Finished difference Result 194519 states and 838925 transitions. [2022-03-01 15:52:37,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-01 15:52:37,902 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 9.108108108108109) internal successors, (337), 37 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-03-01 15:52:37,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:52:38,902 INFO L225 Difference]: With dead ends: 194519 [2022-03-01 15:52:38,903 INFO L226 Difference]: Without dead ends: 137857 [2022-03-01 15:52:38,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 272 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=554, Invalid=2998, Unknown=4, NotChecked=476, Total=4032 [2022-03-01 15:52:38,904 INFO L933 BasicCegarLoop]: 304 mSDtfsCounter, 1724 mSDsluCounter, 4411 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1724 SdHoareTripleChecker+Valid, 4390 SdHoareTripleChecker+Invalid, 3139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1768 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 15:52:38,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1724 Valid, 4390 Invalid, 3139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1261 Invalid, 0 Unknown, 1768 Unchecked, 0.6s Time] [2022-03-01 15:52:39,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137857 states. [2022-03-01 15:52:41,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137857 to 34727. [2022-03-01 15:52:41,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34727 states, 34726 states have (on average 4.253038069458043) internal successors, (147691), 34726 states have internal predecessors, (147691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:41,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34727 states to 34727 states and 147691 transitions. [2022-03-01 15:52:41,528 INFO L78 Accepts]: Start accepts. Automaton has 34727 states and 147691 transitions. Word has length 143 [2022-03-01 15:52:41,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:52:41,528 INFO L470 AbstractCegarLoop]: Abstraction has 34727 states and 147691 transitions. [2022-03-01 15:52:41,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 9.108108108108109) internal successors, (337), 37 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:41,528 INFO L276 IsEmpty]: Start isEmpty. Operand 34727 states and 147691 transitions. [2022-03-01 15:52:41,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-01 15:52:41,615 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:52:41,615 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-01 15:52:41,631 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-03-01 15:52:41,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:52:41,816 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:52:41,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:52:41,816 INFO L85 PathProgramCache]: Analyzing trace with hash -263687870, now seen corresponding path program 3 times [2022-03-01 15:52:41,816 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:52:41,816 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542879616] [2022-03-01 15:52:41,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:52:41,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:52:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:52:42,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:52:42,165 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:52:42,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542879616] [2022-03-01 15:52:42,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542879616] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:52:42,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208081518] [2022-03-01 15:52:42,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 15:52:42,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:52:42,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:52:42,166 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-03-01 15:52:42,167 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-03-01 15:52:42,326 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-01 15:52:42,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:52:42,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 38 conjunts are in the unsatisfiable core [2022-03-01 15:52:42,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:52:43,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:52:43,261 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2022-03-01 15:52:43,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:52:43,327 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2022-03-01 15:52:43,394 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-03-01 15:52:43,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:52:43,474 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 18 [2022-03-01 15:52:43,501 INFO L387 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 17 treesize of output 9 [2022-03-01 15:52:43,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:52:43,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:52:43,721 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_280 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_280) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))) is different from false [2022-03-01 15:52:43,792 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_280 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| c_~A~0.base)) (.cse2 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|)))) (let ((.cse0 (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse1 .cse2 v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_280) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (not (<= (+ (select .cse1 .cse2) 1) v_ArrVal_278)) (<= c_~min~0 (+ .cse0 1)))))) is different from false [2022-03-01 15:52:43,820 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_280 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (let ((.cse1 (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_280) c_~A~0.base) c_~A~0.offset))) (or (not (<= (+ (select .cse0 c_~A~0.offset) 1) v_ArrVal_278)) (<= c_~min~0 (+ .cse1 1)) (<= 2147483647 .cse1))))) is different from false [2022-03-01 15:52:43,848 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277))) (let ((.cse1 (select .cse2 c_~A~0.base))) (let ((.cse0 (select (select (store (store .cse2 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_280) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0) (not (<= (+ (select .cse1 c_~A~0.offset) 1) v_ArrVal_278))))))) is different from false [2022-03-01 15:52:43,920 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277))) (let ((.cse1 (select .cse2 c_~A~0.base))) (let ((.cse0 (select (select (store (store .cse2 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_280) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (not (<= (+ (select .cse1 c_~A~0.offset) 1) v_ArrVal_278)) (<= c_~min~0 (+ .cse0 1))))))) is different from false [2022-03-01 15:52:44,184 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277))) (let ((.cse4 (select .cse5 c_~A~0.base))) (let ((.cse3 (select (select (store (store .cse5 c_~A~0.base (store .cse4 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_280) c_~A~0.base) c_~A~0.offset))) (or (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse0 (< c_~min~0 .cse1)) (.cse2 (+ .cse3 1))) (and (or .cse0 (<= .cse1 .cse2)) (or (not .cse0) (<= c_~min~0 .cse2))))) (<= 2147483647 .cse3) (not (<= (+ (select .cse4 c_~A~0.offset) 1) v_ArrVal_278))))))) is different from false [2022-03-01 15:52:44,343 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277))) (let ((.cse1 (select .cse5 c_~A~0.base))) (let ((.cse0 (select (select (store (store .cse5 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_280) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (not (<= (+ (select .cse1 c_~A~0.offset) 1) v_ArrVal_278)) (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse3 (+ .cse0 1)) (.cse4 (< c_~min~0 .cse2))) (and (or (<= .cse2 .cse3) .cse4) (or (<= c_~min~0 .cse3) (not .cse4)))))))))) is different from false [2022-03-01 15:52:44,427 INFO L387 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 315 treesize of output 279 [2022-03-01 15:52:44,431 INFO L387 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 219 treesize of output 203 [2022-03-01 15:52:44,435 INFO L387 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 60 treesize of output 56 [2022-03-01 15:52:44,439 INFO L387 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 56 treesize of output 54 [2022-03-01 15:52:45,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-03-01 15:52:45,283 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208081518] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:52:45,283 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:52:45,283 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 22] total 52 [2022-03-01 15:52:45,283 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303365580] [2022-03-01 15:52:45,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:52:45,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-03-01 15:52:45,284 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:52:45,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-03-01 15:52:45,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1822, Unknown=7, NotChecked=644, Total=2652 [2022-03-01 15:52:45,285 INFO L87 Difference]: Start difference. First operand 34727 states and 147691 transitions. Second operand has 52 states, 52 states have (on average 6.538461538461538) internal successors, (340), 52 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:51,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:52:51,903 INFO L93 Difference]: Finished difference Result 275931 states and 1198537 transitions. [2022-03-01 15:52:51,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-01 15:52:51,904 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 6.538461538461538) internal successors, (340), 52 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-03-01 15:52:51,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:52:52,870 INFO L225 Difference]: With dead ends: 275931 [2022-03-01 15:52:52,870 INFO L226 Difference]: Without dead ends: 179015 [2022-03-01 15:52:52,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 255 SyntacticMatches, 11 SemanticMatches, 93 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1890 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1558, Invalid=6119, Unknown=7, NotChecked=1246, Total=8930 [2022-03-01 15:52:52,872 INFO L933 BasicCegarLoop]: 483 mSDtfsCounter, 2935 mSDsluCounter, 6814 mSDsCounter, 0 mSdLazyCounter, 2558 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2935 SdHoareTripleChecker+Valid, 6772 SdHoareTripleChecker+Invalid, 7702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5035 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:52:52,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2935 Valid, 6772 Invalid, 7702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2558 Invalid, 0 Unknown, 5035 Unchecked, 1.1s Time] [2022-03-01 15:52:53,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179015 states. [2022-03-01 15:52:55,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179015 to 34147. [2022-03-01 15:52:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34147 states, 34146 states have (on average 4.24767176243191) internal successors, (145041), 34146 states have internal predecessors, (145041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34147 states to 34147 states and 145041 transitions. [2022-03-01 15:52:56,482 INFO L78 Accepts]: Start accepts. Automaton has 34147 states and 145041 transitions. Word has length 143 [2022-03-01 15:52:56,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:52:56,482 INFO L470 AbstractCegarLoop]: Abstraction has 34147 states and 145041 transitions. [2022-03-01 15:52:56,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 6.538461538461538) internal successors, (340), 52 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:56,482 INFO L276 IsEmpty]: Start isEmpty. Operand 34147 states and 145041 transitions. [2022-03-01 15:52:56,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-01 15:52:56,576 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:52:56,576 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-01 15:52:56,595 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-03-01 15:52:56,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:52:56,785 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:52:56,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:52:56,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1870998198, now seen corresponding path program 4 times [2022-03-01 15:52:56,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:52:56,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673448605] [2022-03-01 15:52:56,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:52:56,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:52:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:52:56,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-01 15:52:56,858 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:52:56,858 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673448605] [2022-03-01 15:52:56,858 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673448605] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:52:56,858 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:52:56,858 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-01 15:52:56,858 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873183804] [2022-03-01 15:52:56,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:52:56,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 15:52:56,859 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:52:56,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 15:52:56,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-01 15:52:56,859 INFO L87 Difference]: Start difference. First operand 34147 states and 145041 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:57,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:52:57,741 INFO L93 Difference]: Finished difference Result 49552 states and 212202 transitions. [2022-03-01 15:52:57,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-01 15:52:57,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-03-01 15:52:57,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:52:57,911 INFO L225 Difference]: With dead ends: 49552 [2022-03-01 15:52:57,911 INFO L226 Difference]: Without dead ends: 29945 [2022-03-01 15:52:57,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-03-01 15:52:57,913 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 56 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:52:57,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 698 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 15:52:57,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29945 states. [2022-03-01 15:52:58,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29945 to 29945. [2022-03-01 15:52:58,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29945 states, 29944 states have (on average 4.260786802030457) internal successors, (127585), 29944 states have internal predecessors, (127585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:58,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29945 states to 29945 states and 127585 transitions. [2022-03-01 15:52:58,886 INFO L78 Accepts]: Start accepts. Automaton has 29945 states and 127585 transitions. Word has length 143 [2022-03-01 15:52:58,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:52:58,886 INFO L470 AbstractCegarLoop]: Abstraction has 29945 states and 127585 transitions. [2022-03-01 15:52:58,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:58,886 INFO L276 IsEmpty]: Start isEmpty. Operand 29945 states and 127585 transitions. [2022-03-01 15:52:58,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-01 15:52:58,953 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:52:58,953 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-01 15:52:58,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-01 15:52:58,953 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:52:58,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:52:58,954 INFO L85 PathProgramCache]: Analyzing trace with hash -342153556, now seen corresponding path program 5 times [2022-03-01 15:52:58,954 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:52:58,954 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199430231] [2022-03-01 15:52:58,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:52:58,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:52:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:52:59,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:52:59,062 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:52:59,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199430231] [2022-03-01 15:52:59,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199430231] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:52:59,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200156404] [2022-03-01 15:52:59,062 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 15:52:59,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:52:59,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:52:59,064 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-03-01 15:52:59,064 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-03-01 15:52:59,157 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-01 15:52:59,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:52:59,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-01 15:52:59,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:52:59,313 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:52:59,314 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 41 [2022-03-01 15:52:59,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:52:59,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:52:59,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:52:59,934 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200156404] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:52:59,934 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:52:59,934 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-03-01 15:52:59,934 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510204323] [2022-03-01 15:52:59,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:52:59,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-01 15:52:59,935 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:52:59,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-01 15:52:59,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-03-01 15:52:59,935 INFO L87 Difference]: Start difference. First operand 29945 states and 127585 transitions. Second operand has 16 states, 16 states have (on average 15.125) internal successors, (242), 16 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:01,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:53:01,670 INFO L93 Difference]: Finished difference Result 157839 states and 681442 transitions. [2022-03-01 15:53:01,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-01 15:53:01,670 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 15.125) internal successors, (242), 16 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-03-01 15:53:01,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:53:02,187 INFO L225 Difference]: With dead ends: 157839 [2022-03-01 15:53:02,187 INFO L226 Difference]: Without dead ends: 103206 [2022-03-01 15:53:02,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=560, Unknown=0, NotChecked=0, Total=756 [2022-03-01 15:53:02,188 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 617 mSDsluCounter, 2011 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 2107 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 15:53:02,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [617 Valid, 2107 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 467 Invalid, 0 Unknown, 142 Unchecked, 0.2s Time] [2022-03-01 15:53:02,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103206 states. [2022-03-01 15:53:04,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103206 to 61925. [2022-03-01 15:53:04,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61925 states, 61924 states have (on average 4.077417479490989) internal successors, (252490), 61924 states have internal predecessors, (252490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:04,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61925 states to 61925 states and 252490 transitions. [2022-03-01 15:53:04,911 INFO L78 Accepts]: Start accepts. Automaton has 61925 states and 252490 transitions. Word has length 143 [2022-03-01 15:53:04,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:53:04,912 INFO L470 AbstractCegarLoop]: Abstraction has 61925 states and 252490 transitions. [2022-03-01 15:53:04,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 15.125) internal successors, (242), 16 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:04,912 INFO L276 IsEmpty]: Start isEmpty. Operand 61925 states and 252490 transitions. [2022-03-01 15:53:05,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-01 15:53:05,066 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:53:05,066 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-01 15:53:05,083 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-03-01 15:53:05,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:53:05,279 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:53:05,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:53:05,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1120956340, now seen corresponding path program 6 times [2022-03-01 15:53:05,280 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:53:05,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515318731] [2022-03-01 15:53:05,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:53:05,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:53:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:53:05,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:53:05,416 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:53:05,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515318731] [2022-03-01 15:53:05,416 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515318731] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:53:05,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79742808] [2022-03-01 15:53:05,416 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 15:53:05,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:53:05,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:53:05,417 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-03-01 15:53:05,418 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-03-01 15:53:05,529 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-01 15:53:05,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:53:05,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-01 15:53:05,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:53:06,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:53:06,095 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 21 [2022-03-01 15:53:06,185 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 35 treesize of output 19 [2022-03-01 15:53:06,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:53:06,320 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 18 [2022-03-01 15:53:06,366 INFO L387 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 17 treesize of output 9 [2022-03-01 15:53:06,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:53:06,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:53:08,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:53:08,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79742808] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:53:08,792 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:53:08,792 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 21, 15] total 37 [2022-03-01 15:53:08,792 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785605144] [2022-03-01 15:53:08,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:53:08,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-01 15:53:08,792 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:53:08,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-01 15:53:08,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1072, Unknown=38, NotChecked=0, Total=1332 [2022-03-01 15:53:08,793 INFO L87 Difference]: Start difference. First operand 61925 states and 252490 transitions. Second operand has 37 states, 37 states have (on average 8.675675675675675) internal successors, (321), 37 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:19,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:53:19,970 INFO L93 Difference]: Finished difference Result 226451 states and 945981 transitions. [2022-03-01 15:53:19,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-01 15:53:19,970 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 8.675675675675675) internal successors, (321), 37 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-03-01 15:53:19,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:53:20,548 INFO L225 Difference]: With dead ends: 226451 [2022-03-01 15:53:20,548 INFO L226 Difference]: Without dead ends: 101830 [2022-03-01 15:53:20,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 282 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1863 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=1715, Invalid=5716, Unknown=51, NotChecked=0, Total=7482 [2022-03-01 15:53:20,550 INFO L933 BasicCegarLoop]: 447 mSDtfsCounter, 1709 mSDsluCounter, 6060 mSDsCounter, 0 mSdLazyCounter, 1827 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1709 SdHoareTripleChecker+Valid, 6002 SdHoareTripleChecker+Invalid, 2938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1051 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-01 15:53:20,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1709 Valid, 6002 Invalid, 2938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1827 Invalid, 0 Unknown, 1051 Unchecked, 1.2s Time] [2022-03-01 15:53:20,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101830 states. [2022-03-01 15:53:22,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101830 to 52797. [2022-03-01 15:53:22,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52797 states, 52796 states have (on average 4.1002159254488975) internal successors, (216475), 52796 states have internal predecessors, (216475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:23,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52797 states to 52797 states and 216475 transitions. [2022-03-01 15:53:23,031 INFO L78 Accepts]: Start accepts. Automaton has 52797 states and 216475 transitions. Word has length 143 [2022-03-01 15:53:23,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:53:23,031 INFO L470 AbstractCegarLoop]: Abstraction has 52797 states and 216475 transitions. [2022-03-01 15:53:23,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 8.675675675675675) internal successors, (321), 37 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:23,031 INFO L276 IsEmpty]: Start isEmpty. Operand 52797 states and 216475 transitions. [2022-03-01 15:53:23,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-01 15:53:23,167 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:53:23,167 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-01 15:53:23,183 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-03-01 15:53:23,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:53:23,368 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:53:23,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:53:23,368 INFO L85 PathProgramCache]: Analyzing trace with hash 296544674, now seen corresponding path program 7 times [2022-03-01 15:53:23,368 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:53:23,368 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76567450] [2022-03-01 15:53:23,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:53:23,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:53:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:53:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:53:23,594 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:53:23,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76567450] [2022-03-01 15:53:23,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76567450] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:53:23,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540627987] [2022-03-01 15:53:23,594 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 15:53:23,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:53:23,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:53:23,595 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-03-01 15:53:23,596 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-03-01 15:53:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:53:23,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-01 15:53:23,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:53:23,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:53:23,916 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2022-03-01 15:53:23,964 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-03-01 15:53:24,051 INFO L387 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 17 treesize of output 9 [2022-03-01 15:53:24,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:53:24,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:53:24,810 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_439 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_439) c_~A~0.base) c_~A~0.offset) c_~max~0)) (<= 2147483647 c_~max~0)) is different from false [2022-03-01 15:53:24,837 INFO L387 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 25 treesize of output 17 [2022-03-01 15:53:25,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-03-01 15:53:25,011 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540627987] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:53:25,011 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:53:25,011 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 41 [2022-03-01 15:53:25,011 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672226254] [2022-03-01 15:53:25,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:53:25,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-01 15:53:25,012 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:53:25,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-01 15:53:25,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1393, Unknown=1, NotChecked=76, Total=1640 [2022-03-01 15:53:25,013 INFO L87 Difference]: Start difference. First operand 52797 states and 216475 transitions. Second operand has 41 states, 41 states have (on average 7.560975609756097) internal successors, (310), 41 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:29,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:53:29,471 INFO L93 Difference]: Finished difference Result 240523 states and 1016602 transitions. [2022-03-01 15:53:29,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-01 15:53:29,471 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 7.560975609756097) internal successors, (310), 41 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-03-01 15:53:29,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:53:30,027 INFO L225 Difference]: With dead ends: 240523 [2022-03-01 15:53:30,027 INFO L226 Difference]: Without dead ends: 108537 [2022-03-01 15:53:30,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 261 SyntacticMatches, 5 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1810 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1578, Invalid=5907, Unknown=1, NotChecked=170, Total=7656 [2022-03-01 15:53:30,029 INFO L933 BasicCegarLoop]: 457 mSDtfsCounter, 3270 mSDsluCounter, 6149 mSDsCounter, 0 mSdLazyCounter, 2237 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3270 SdHoareTripleChecker+Valid, 6087 SdHoareTripleChecker+Invalid, 3634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 2237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1124 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:53:30,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3270 Valid, 6087 Invalid, 3634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 2237 Invalid, 0 Unknown, 1124 Unchecked, 1.1s Time] [2022-03-01 15:53:30,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108537 states. [2022-03-01 15:53:31,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108537 to 29472. [2022-03-01 15:53:31,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29472 states, 29471 states have (on average 4.237793084727359) internal successors, (124892), 29471 states have internal predecessors, (124892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29472 states to 29472 states and 124892 transitions. [2022-03-01 15:53:31,993 INFO L78 Accepts]: Start accepts. Automaton has 29472 states and 124892 transitions. Word has length 143 [2022-03-01 15:53:31,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:53:31,993 INFO L470 AbstractCegarLoop]: Abstraction has 29472 states and 124892 transitions. [2022-03-01 15:53:31,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 7.560975609756097) internal successors, (310), 41 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:31,994 INFO L276 IsEmpty]: Start isEmpty. Operand 29472 states and 124892 transitions. [2022-03-01 15:53:32,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-01 15:53:32,064 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:53:32,064 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-01 15:53:32,080 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-03-01 15:53:32,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-01 15:53:32,265 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:53:32,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:53:32,265 INFO L85 PathProgramCache]: Analyzing trace with hash 929095160, now seen corresponding path program 8 times [2022-03-01 15:53:32,265 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:53:32,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10181895] [2022-03-01 15:53:32,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:53:32,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:53:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:53:32,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:53:32,602 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:53:32,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10181895] [2022-03-01 15:53:32,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10181895] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:53:32,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072206945] [2022-03-01 15:53:32,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 15:53:32,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:53:32,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:53:32,603 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-03-01 15:53:32,604 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-03-01 15:53:32,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 15:53:32,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:53:32,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-01 15:53:32,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:53:32,992 INFO L387 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-03-01 15:53:33,016 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-01 15:53:33,017 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-01 15:53:33,173 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-03-01 15:53:33,173 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:53:33,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-01 15:53:33,597 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 16 [2022-03-01 15:53:33,679 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 18 [2022-03-01 15:53:33,783 INFO L387 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 17 treesize of output 9 [2022-03-01 15:53:33,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:53:33,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:53:34,132 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_491 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_491) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1)))) is different from false [2022-03-01 15:53:34,192 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_489 Int) (v_ArrVal_491 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse1 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|)))) (or (<= (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse0 .cse1 v_ArrVal_489)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_491) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1)) (not (<= v_ArrVal_489 (+ (select .cse0 .cse1) 1)))))) (<= 2147483647 c_~max~0)) is different from false [2022-03-01 15:53:34,222 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_489 Int) (v_ArrVal_491 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (or (<= (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_489)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_491) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1)) (not (<= v_ArrVal_489 (+ (select .cse0 c_~A~0.offset) 1))))))) is different from false [2022-03-01 15:53:34,249 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_489 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_488))) (let ((.cse0 (select .cse1 c_~A~0.base))) (or (not (<= v_ArrVal_489 (+ (select .cse0 c_~A~0.offset) 1))) (<= (select (select (store (store .cse1 c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_489)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_491) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1)))))) (<= 2147483647 c_~max~0)) is different from false [2022-03-01 15:53:34,324 INFO L387 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 105 treesize of output 81 [2022-03-01 15:53:34,328 INFO L387 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 54 treesize of output 50 [2022-03-01 15:53:34,333 INFO L387 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 24 treesize of output 22 [2022-03-01 15:53:34,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-03-01 15:53:34,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072206945] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:53:34,741 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:53:34,741 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 51 [2022-03-01 15:53:34,741 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598316186] [2022-03-01 15:53:34,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:53:34,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-01 15:53:34,741 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:53:34,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-01 15:53:34,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1970, Unknown=4, NotChecked=372, Total=2550 [2022-03-01 15:53:34,742 INFO L87 Difference]: Start difference. First operand 29472 states and 124892 transitions. Second operand has 51 states, 51 states have (on average 7.392156862745098) internal successors, (377), 51 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:40,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:53:40,464 INFO L93 Difference]: Finished difference Result 198905 states and 866132 transitions. [2022-03-01 15:53:40,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-01 15:53:40,464 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 7.392156862745098) internal successors, (377), 51 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-03-01 15:53:40,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:53:41,233 INFO L225 Difference]: With dead ends: 198905 [2022-03-01 15:53:41,233 INFO L226 Difference]: Without dead ends: 105323 [2022-03-01 15:53:41,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 255 SyntacticMatches, 6 SemanticMatches, 107 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2385 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2526, Invalid=8406, Unknown=4, NotChecked=836, Total=11772 [2022-03-01 15:53:41,236 INFO L933 BasicCegarLoop]: 366 mSDtfsCounter, 3757 mSDsluCounter, 5830 mSDsCounter, 0 mSdLazyCounter, 2162 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3757 SdHoareTripleChecker+Valid, 5766 SdHoareTripleChecker+Invalid, 4358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 2162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1938 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-01 15:53:41,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3757 Valid, 5766 Invalid, 4358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 2162 Invalid, 0 Unknown, 1938 Unchecked, 1.3s Time] [2022-03-01 15:53:41,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105323 states. [2022-03-01 15:53:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105323 to 28157. [2022-03-01 15:53:42,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28157 states, 28156 states have (on average 4.237249609319505) internal successors, (119304), 28156 states have internal predecessors, (119304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:43,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28157 states to 28157 states and 119304 transitions. [2022-03-01 15:53:43,077 INFO L78 Accepts]: Start accepts. Automaton has 28157 states and 119304 transitions. Word has length 143 [2022-03-01 15:53:43,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:53:43,077 INFO L470 AbstractCegarLoop]: Abstraction has 28157 states and 119304 transitions. [2022-03-01 15:53:43,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 7.392156862745098) internal successors, (377), 51 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:43,077 INFO L276 IsEmpty]: Start isEmpty. Operand 28157 states and 119304 transitions. [2022-03-01 15:53:43,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-01 15:53:43,142 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:53:43,142 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-01 15:53:43,159 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-03-01 15:53:43,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-01 15:53:43,343 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:53:43,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:53:43,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1049396362, now seen corresponding path program 9 times [2022-03-01 15:53:43,344 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:53:43,344 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124577667] [2022-03-01 15:53:43,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:53:43,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:53:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:53:43,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-01 15:53:43,412 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:53:43,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124577667] [2022-03-01 15:53:43,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124577667] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:53:43,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298250989] [2022-03-01 15:53:43,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 15:53:43,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:53:43,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:53:43,414 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-03-01 15:53:43,415 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-03-01 15:53:43,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-01 15:53:43,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:53:43,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-01 15:53:43,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:53:43,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-01 15:53:43,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:53:43,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-01 15:53:43,956 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298250989] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:53:43,956 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:53:43,957 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-03-01 15:53:43,957 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109696876] [2022-03-01 15:53:43,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:53:43,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-01 15:53:43,957 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:53:43,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-01 15:53:43,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-03-01 15:53:43,958 INFO L87 Difference]: Start difference. First operand 28157 states and 119304 transitions. Second operand has 9 states, 9 states have (on average 33.666666666666664) internal successors, (303), 9 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:44,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:53:44,483 INFO L93 Difference]: Finished difference Result 38564 states and 164557 transitions. [2022-03-01 15:53:44,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-01 15:53:44,483 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.666666666666664) internal successors, (303), 9 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-03-01 15:53:44,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:53:44,564 INFO L225 Difference]: With dead ends: 38564 [2022-03-01 15:53:44,564 INFO L226 Difference]: Without dead ends: 22799 [2022-03-01 15:53:44,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-03-01 15:53:44,565 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 85 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:53:44,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 741 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 15:53:44,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22799 states. [2022-03-01 15:53:45,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22799 to 22679. [2022-03-01 15:53:45,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22679 states, 22678 states have (on average 4.1738248522797425) internal successors, (94654), 22678 states have internal predecessors, (94654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:45,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22679 states to 22679 states and 94654 transitions. [2022-03-01 15:53:45,230 INFO L78 Accepts]: Start accepts. Automaton has 22679 states and 94654 transitions. Word has length 143 [2022-03-01 15:53:45,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:53:45,231 INFO L470 AbstractCegarLoop]: Abstraction has 22679 states and 94654 transitions. [2022-03-01 15:53:45,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.666666666666664) internal successors, (303), 9 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:45,231 INFO L276 IsEmpty]: Start isEmpty. Operand 22679 states and 94654 transitions. [2022-03-01 15:53:45,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-03-01 15:53:45,282 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:53:45,282 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-01 15:53:45,299 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-03-01 15:53:45,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-01 15:53:45,483 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:53:45,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:53:45,483 INFO L85 PathProgramCache]: Analyzing trace with hash 222105859, now seen corresponding path program 10 times [2022-03-01 15:53:45,483 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:53:45,483 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652931605] [2022-03-01 15:53:45,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:53:45,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:53:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:53:45,579 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:53:45,579 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:53:45,579 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652931605] [2022-03-01 15:53:45,579 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652931605] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:53:45,579 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454832175] [2022-03-01 15:53:45,579 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 15:53:45,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:53:45,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:53:45,580 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-03-01 15:53:45,581 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-03-01 15:53:45,679 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 15:53:45,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:53:45,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-01 15:53:45,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:53:45,940 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:53:45,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:53:46,233 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:53:46,234 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454832175] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:53:46,234 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:53:46,234 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-03-01 15:53:46,234 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973042295] [2022-03-01 15:53:46,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:53:46,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-01 15:53:46,234 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:53:46,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-01 15:53:46,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-03-01 15:53:46,235 INFO L87 Difference]: Start difference. First operand 22679 states and 94654 transitions. Second operand has 24 states, 24 states have (on average 8.208333333333334) internal successors, (197), 24 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:46,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:53:46,848 INFO L93 Difference]: Finished difference Result 24058 states and 98308 transitions. [2022-03-01 15:53:46,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 15:53:46,848 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.208333333333334) internal successors, (197), 24 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2022-03-01 15:53:46,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:53:46,930 INFO L225 Difference]: With dead ends: 24058 [2022-03-01 15:53:46,930 INFO L226 Difference]: Without dead ends: 22691 [2022-03-01 15:53:46,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=305, Invalid=955, Unknown=0, NotChecked=0, Total=1260 [2022-03-01 15:53:46,931 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 1260 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 15:53:46,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1260 Valid, 1430 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 15:53:46,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22691 states. [2022-03-01 15:53:47,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22691 to 22686. [2022-03-01 15:53:47,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22686 states, 22685 states have (on average 4.172845492616267) internal successors, (94661), 22685 states have internal predecessors, (94661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:47,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22686 states to 22686 states and 94661 transitions. [2022-03-01 15:53:47,618 INFO L78 Accepts]: Start accepts. Automaton has 22686 states and 94661 transitions. Word has length 148 [2022-03-01 15:53:47,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:53:47,618 INFO L470 AbstractCegarLoop]: Abstraction has 22686 states and 94661 transitions. [2022-03-01 15:53:47,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.208333333333334) internal successors, (197), 24 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:47,618 INFO L276 IsEmpty]: Start isEmpty. Operand 22686 states and 94661 transitions. [2022-03-01 15:53:47,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-03-01 15:53:47,674 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:53:47,675 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-01 15:53:47,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-01 15:53:47,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-01 15:53:47,897 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:53:47,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:53:47,898 INFO L85 PathProgramCache]: Analyzing trace with hash 170978604, now seen corresponding path program 11 times [2022-03-01 15:53:47,898 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:53:47,898 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681850689] [2022-03-01 15:53:47,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:53:47,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:53:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:53:48,049 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-01 15:53:48,050 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:53:48,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681850689] [2022-03-01 15:53:48,050 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681850689] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:53:48,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988280198] [2022-03-01 15:53:48,050 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 15:53:48,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:53:48,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:53:48,052 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:53:48,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-01 15:53:48,165 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-01 15:53:48,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:53:48,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-01 15:53:48,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:53:48,474 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:53:48,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:53:48,681 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:53:48,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988280198] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:53:48,681 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:53:48,681 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2022-03-01 15:53:48,681 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536900190] [2022-03-01 15:53:48,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:53:48,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-01 15:53:48,682 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:53:48,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-01 15:53:48,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2022-03-01 15:53:48,682 INFO L87 Difference]: Start difference. First operand 22686 states and 94661 transitions. Second operand has 23 states, 23 states have (on average 11.956521739130435) internal successors, (275), 23 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:50,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:53:50,643 INFO L93 Difference]: Finished difference Result 85789 states and 362636 transitions. [2022-03-01 15:53:50,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-01 15:53:50,644 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 11.956521739130435) internal successors, (275), 23 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2022-03-01 15:53:50,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:53:51,058 INFO L225 Difference]: With dead ends: 85789 [2022-03-01 15:53:51,059 INFO L226 Difference]: Without dead ends: 85789 [2022-03-01 15:53:51,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=858, Invalid=2682, Unknown=0, NotChecked=0, Total=3540 [2022-03-01 15:53:51,060 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 1540 mSDsluCounter, 2556 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1540 SdHoareTripleChecker+Valid, 2514 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-01 15:53:51,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1540 Valid, 2514 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-01 15:53:51,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85789 states. [2022-03-01 15:53:52,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85789 to 47858. [2022-03-01 15:53:52,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47858 states, 47857 states have (on average 4.272478425308733) internal successors, (204468), 47857 states have internal predecessors, (204468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:52,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47858 states to 47858 states and 204468 transitions. [2022-03-01 15:53:52,895 INFO L78 Accepts]: Start accepts. Automaton has 47858 states and 204468 transitions. Word has length 155 [2022-03-01 15:53:52,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:53:52,895 INFO L470 AbstractCegarLoop]: Abstraction has 47858 states and 204468 transitions. [2022-03-01 15:53:52,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 11.956521739130435) internal successors, (275), 23 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:52,896 INFO L276 IsEmpty]: Start isEmpty. Operand 47858 states and 204468 transitions. [2022-03-01 15:53:53,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-03-01 15:53:53,277 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:53:53,277 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-01 15:53:53,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-01 15:53:53,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-01 15:53:53,487 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:53:53,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:53:53,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1108672049, now seen corresponding path program 12 times [2022-03-01 15:53:53,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:53:53,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749787575] [2022-03-01 15:53:53,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:53:53,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:53:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:53:53,576 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-01 15:53:53,576 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:53:53,576 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749787575] [2022-03-01 15:53:53,576 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749787575] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:53:53,576 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077731730] [2022-03-01 15:53:53,576 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 15:53:53,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:53:53,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:53:53,577 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:53:53,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-01 15:53:53,690 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-01 15:53:53,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:53:53,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-01 15:53:53,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:53:53,978 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-03-01 15:53:53,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:53:54,158 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-03-01 15:53:54,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077731730] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:53:54,158 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:53:54,158 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2022-03-01 15:53:54,158 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063376707] [2022-03-01 15:53:54,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:53:54,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-01 15:53:54,159 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:53:54,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-01 15:53:54,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-03-01 15:53:54,159 INFO L87 Difference]: Start difference. First operand 47858 states and 204468 transitions. Second operand has 19 states, 19 states have (on average 12.789473684210526) internal successors, (243), 19 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:55,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:53:55,368 INFO L93 Difference]: Finished difference Result 80479 states and 347149 transitions. [2022-03-01 15:53:55,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-01 15:53:55,368 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.789473684210526) internal successors, (243), 19 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2022-03-01 15:53:55,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:53:55,872 INFO L225 Difference]: With dead ends: 80479 [2022-03-01 15:53:55,872 INFO L226 Difference]: Without dead ends: 80479 [2022-03-01 15:53:55,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 325 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=384, Invalid=1176, Unknown=0, NotChecked=0, Total=1560 [2022-03-01 15:53:55,879 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 759 mSDsluCounter, 1926 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 1975 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 15:53:55,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [759 Valid, 1975 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 15:53:55,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80479 states. [2022-03-01 15:53:57,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80479 to 67618. [2022-03-01 15:53:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67618 states, 67617 states have (on average 4.315896889835396) internal successors, (291828), 67617 states have internal predecessors, (291828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67618 states to 67618 states and 291828 transitions. [2022-03-01 15:53:58,079 INFO L78 Accepts]: Start accepts. Automaton has 67618 states and 291828 transitions. Word has length 160 [2022-03-01 15:53:58,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:53:58,079 INFO L470 AbstractCegarLoop]: Abstraction has 67618 states and 291828 transitions. [2022-03-01 15:53:58,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.789473684210526) internal successors, (243), 19 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 67618 states and 291828 transitions. [2022-03-01 15:53:58,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-03-01 15:53:58,259 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:53:58,259 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-01 15:53:58,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-01 15:53:58,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-01 15:53:58,460 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:53:58,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:53:58,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1193294040, now seen corresponding path program 13 times [2022-03-01 15:53:58,460 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:53:58,460 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236964943] [2022-03-01 15:53:58,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:53:58,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:53:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:53:58,740 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-03-01 15:53:58,740 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:53:58,740 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236964943] [2022-03-01 15:53:58,740 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236964943] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:53:58,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219386929] [2022-03-01 15:53:58,741 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 15:53:58,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:53:58,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:53:58,742 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:53:58,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-01 15:53:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:53:58,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-01 15:53:58,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:53:59,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:53:59,081 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2022-03-01 15:53:59,131 INFO L353 Elim1Store]: treesize reduction 41, result has 6.8 percent of original size [2022-03-01 15:53:59,132 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 23 [2022-03-01 15:53:59,207 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-03-01 15:53:59,207 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 24 [2022-03-01 15:53:59,317 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:53:59,317 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 34 [2022-03-01 15:53:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-03-01 15:53:59,414 INFO L328 TraceCheckSpWp]: Computing backward predicates...