/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-more-min-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 14:17:19,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 14:17:19,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 14:17:19,421 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 14:17:19,421 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 14:17:19,422 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 14:17:19,423 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 14:17:19,433 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 14:17:19,434 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 14:17:19,435 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 14:17:19,435 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 14:17:19,436 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 14:17:19,436 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 14:17:19,441 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 14:17:19,441 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 14:17:19,442 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 14:17:19,442 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 14:17:19,443 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 14:17:19,444 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 14:17:19,445 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 14:17:19,446 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 14:17:19,448 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 14:17:19,451 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 14:17:19,452 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 14:17:19,457 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 14:17:19,457 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 14:17:19,457 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 14:17:19,458 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 14:17:19,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 14:17:19,459 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 14:17:19,459 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 14:17:19,460 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 14:17:19,461 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 14:17:19,462 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 14:17:19,463 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 14:17:19,463 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 14:17:19,463 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 14:17:19,463 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 14:17:19,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 14:17:19,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 14:17:19,465 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 14:17:19,465 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-15 14:17:19,490 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 14:17:19,490 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 14:17:19,491 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-15 14:17:19,491 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-15 14:17:19,492 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 14:17:19,492 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 14:17:19,492 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 14:17:19,492 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 14:17:19,492 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 14:17:19,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 14:17:19,493 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 14:17:19,493 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 14:17:19,493 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 14:17:19,494 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 14:17:19,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 14:17:19,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 14:17:19,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 14:17:19,494 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 14:17:19,494 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 14:17:19,494 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 14:17:19,494 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 14:17:19,494 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 14:17:19,494 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 14:17:19,495 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 14:17:19,495 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 14:17:19,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 14:17:19,495 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 14:17:19,495 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-15 14:17:19,495 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 14:17:19,495 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 14:17:19,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 14:17:19,495 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-15 14:17:19,496 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 14:17:19,496 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-15 14:17:19,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 14:17:19,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 14:17:19,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 14:17:19,746 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 14:17:19,746 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 14:17:19,747 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2022-03-15 14:17:19,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30ea32f7c/6327a35d21104f059b6dca268dc39586/FLAG0fab6d2e9 [2022-03-15 14:17:20,124 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 14:17:20,125 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2022-03-15 14:17:20,130 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30ea32f7c/6327a35d21104f059b6dca268dc39586/FLAG0fab6d2e9 [2022-03-15 14:17:20,541 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30ea32f7c/6327a35d21104f059b6dca268dc39586 [2022-03-15 14:17:20,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 14:17:20,543 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 14:17:20,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 14:17:20,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 14:17:20,547 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 14:17:20,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:17:20" (1/1) ... [2022-03-15 14:17:20,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d6d2d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:20, skipping insertion in model container [2022-03-15 14:17:20,548 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:17:20" (1/1) ... [2022-03-15 14:17:20,552 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 14:17:20,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 14:17:20,728 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-more-min-array-hom.wvr.c[2586,2599] [2022-03-15 14:17:20,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 14:17:20,746 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 14:17:20,775 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-more-min-array-hom.wvr.c[2586,2599] [2022-03-15 14:17:20,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 14:17:20,787 INFO L208 MainTranslator]: Completed translation [2022-03-15 14:17:20,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:20 WrapperNode [2022-03-15 14:17:20,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 14:17:20,788 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 14:17:20,788 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 14:17:20,789 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 14:17:20,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:20" (1/1) ... [2022-03-15 14:17:20,805 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:20" (1/1) ... [2022-03-15 14:17:20,829 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 106 [2022-03-15 14:17:20,829 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 14:17:20,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 14:17:20,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 14:17:20,830 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 14:17:20,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:20" (1/1) ... [2022-03-15 14:17:20,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:20" (1/1) ... [2022-03-15 14:17:20,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:20" (1/1) ... [2022-03-15 14:17:20,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:20" (1/1) ... [2022-03-15 14:17:20,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:20" (1/1) ... [2022-03-15 14:17:20,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:20" (1/1) ... [2022-03-15 14:17:20,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:20" (1/1) ... [2022-03-15 14:17:20,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 14:17:20,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 14:17:20,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 14:17:20,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 14:17:20,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:20" (1/1) ... [2022-03-15 14:17:20,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 14:17:20,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:17:20,889 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-15 14:17:20,928 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-15 14:17:20,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 14:17:20,938 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 14:17:20,939 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 14:17:20,939 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 14:17:20,939 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 14:17:20,939 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 14:17:20,939 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 14:17:20,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 14:17:20,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 14:17:20,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 14:17:20,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 14:17:20,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 14:17:20,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 14:17:20,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 14:17:20,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 14:17:20,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 14:17:20,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 14:17:20,941 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 14:17:21,039 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 14:17:21,040 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 14:17:21,204 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 14:17:21,240 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 14:17:21,240 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-15 14:17:21,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:17:21 BoogieIcfgContainer [2022-03-15 14:17:21,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 14:17:21,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 14:17:21,243 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 14:17:21,245 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 14:17:21,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 02:17:20" (1/3) ... [2022-03-15 14:17:21,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53bd61f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:17:21, skipping insertion in model container [2022-03-15 14:17:21,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:20" (2/3) ... [2022-03-15 14:17:21,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53bd61f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:17:21, skipping insertion in model container [2022-03-15 14:17:21,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:17:21" (3/3) ... [2022-03-15 14:17:21,247 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2022-03-15 14:17:21,250 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 14:17:21,250 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-15 14:17:21,250 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 14:17:21,250 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 14:17:21,276 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,276 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,276 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,276 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,277 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,277 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,277 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,277 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,277 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,277 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,277 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,277 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,277 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,278 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,278 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,278 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,278 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,278 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,279 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,279 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,279 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,279 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,279 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,279 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,279 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,279 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,280 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,280 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,280 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,280 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,280 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,280 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,280 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,281 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,281 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,281 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,281 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,281 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,281 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,281 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,281 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,282 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,282 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,282 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,282 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,282 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,282 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,283 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,283 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,283 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,283 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,283 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,283 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,283 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,283 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,283 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,284 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,284 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,284 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,284 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,284 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,284 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,285 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,285 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,285 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,285 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,285 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,285 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,285 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,285 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,286 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,286 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,286 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,286 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,286 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,286 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,287 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,287 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,287 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,287 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,287 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,287 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,287 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,287 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,290 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,290 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,290 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,290 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,290 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,290 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,291 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,291 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,291 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,291 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,291 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,291 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,292 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,292 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,292 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,292 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,292 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,292 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:17:21,295 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 14:17:21,321 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 14:17:21,326 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-15 14:17:21,327 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 14:17:21,339 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 156 places, 159 transitions, 342 flow [2022-03-15 14:17:21,490 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3813 states, 3812 states have (on average 3.809286463798531) internal successors, (14521), 3812 states have internal predecessors, (14521), 0 states have call successors, (0), 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-15 14:17:21,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 3813 states, 3812 states have (on average 3.809286463798531) internal successors, (14521), 3812 states have internal predecessors, (14521), 0 states have call successors, (0), 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-15 14:17:21,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-03-15 14:17:21,531 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:17:21,532 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] [2022-03-15 14:17:21,532 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:17:21,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:17:21,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1987118534, now seen corresponding path program 1 times [2022-03-15 14:17:21,544 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:17:21,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933764724] [2022-03-15 14:17:21,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:17:21,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:17:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:17:21,700 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-15 14:17:21,700 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:17:21,701 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933764724] [2022-03-15 14:17:21,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933764724] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:17:21,701 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:17:21,701 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 14:17:21,702 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128498494] [2022-03-15 14:17:21,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:17:21,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-15 14:17:21,705 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:17:21,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-15 14:17:21,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 14:17:21,731 INFO L87 Difference]: Start difference. First operand has 3813 states, 3812 states have (on average 3.809286463798531) internal successors, (14521), 3812 states have internal predecessors, (14521), 0 states have call successors, (0), 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 54.5) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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-15 14:17:21,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:17:21,813 INFO L93 Difference]: Finished difference Result 3813 states and 13373 transitions. [2022-03-15 14:17:21,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 14:17:21,816 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2022-03-15 14:17:21,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:17:21,858 INFO L225 Difference]: With dead ends: 3813 [2022-03-15 14:17:21,858 INFO L226 Difference]: Without dead ends: 3809 [2022-03-15 14:17:21,861 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-15 14:17:21,864 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:17:21,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 14:17:21,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3809 states. [2022-03-15 14:17:22,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3809 to 3809. [2022-03-15 14:17:22,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3809 states, 3808 states have (on average 3.510766806722689) internal successors, (13369), 3808 states have internal predecessors, (13369), 0 states have call successors, (0), 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-15 14:17:22,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3809 states to 3809 states and 13369 transitions. [2022-03-15 14:17:22,070 INFO L78 Accepts]: Start accepts. Automaton has 3809 states and 13369 transitions. Word has length 109 [2022-03-15 14:17:22,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:17:22,071 INFO L470 AbstractCegarLoop]: Abstraction has 3809 states and 13369 transitions. [2022-03-15 14:17:22,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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-15 14:17:22,072 INFO L276 IsEmpty]: Start isEmpty. Operand 3809 states and 13369 transitions. [2022-03-15 14:17:22,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-03-15 14:17:22,082 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:17:22,083 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] [2022-03-15 14:17:22,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 14:17:22,084 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:17:22,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:17:22,086 INFO L85 PathProgramCache]: Analyzing trace with hash 669998521, now seen corresponding path program 1 times [2022-03-15 14:17:22,086 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:17:22,086 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233527383] [2022-03-15 14:17:22,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:17:22,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:17:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:17:22,319 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-15 14:17:22,319 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:17:22,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233527383] [2022-03-15 14:17:22,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233527383] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:17:22,320 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:17:22,320 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 14:17:22,320 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266733201] [2022-03-15 14:17:22,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:17:22,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 14:17:22,321 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:17:22,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 14:17:22,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 14:17:22,326 INFO L87 Difference]: Start difference. First operand 3809 states and 13369 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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-15 14:17:22,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:17:22,494 INFO L93 Difference]: Finished difference Result 7071 states and 25089 transitions. [2022-03-15 14:17:22,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 14:17:22,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2022-03-15 14:17:22,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:17:22,578 INFO L225 Difference]: With dead ends: 7071 [2022-03-15 14:17:22,579 INFO L226 Difference]: Without dead ends: 7071 [2022-03-15 14:17:22,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 14:17:22,580 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 181 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:17:22,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 212 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 14:17:22,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7071 states. [2022-03-15 14:17:22,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7071 to 4978. [2022-03-15 14:17:22,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4978 states, 4977 states have (on average 3.5173799477596948) internal successors, (17506), 4977 states have internal predecessors, (17506), 0 states have call successors, (0), 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-15 14:17:22,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4978 states to 4978 states and 17506 transitions. [2022-03-15 14:17:22,777 INFO L78 Accepts]: Start accepts. Automaton has 4978 states and 17506 transitions. Word has length 109 [2022-03-15 14:17:22,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:17:22,778 INFO L470 AbstractCegarLoop]: Abstraction has 4978 states and 17506 transitions. [2022-03-15 14:17:22,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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-15 14:17:22,779 INFO L276 IsEmpty]: Start isEmpty. Operand 4978 states and 17506 transitions. [2022-03-15 14:17:22,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-03-15 14:17:22,795 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:17:22,796 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] [2022-03-15 14:17:22,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 14:17:22,796 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:17:22,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:17:22,797 INFO L85 PathProgramCache]: Analyzing trace with hash 62354435, now seen corresponding path program 1 times [2022-03-15 14:17:22,797 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:17:22,797 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780422017] [2022-03-15 14:17:22,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:17:22,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:17:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:17:23,079 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-15 14:17:23,080 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:17:23,080 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780422017] [2022-03-15 14:17:23,080 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780422017] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:17:23,081 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:17:23,081 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 14:17:23,081 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837084079] [2022-03-15 14:17:23,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:17:23,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 14:17:23,089 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:17:23,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 14:17:23,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-03-15 14:17:23,090 INFO L87 Difference]: Start difference. First operand 4978 states and 17506 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 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-15 14:17:23,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:17:23,299 INFO L93 Difference]: Finished difference Result 4994 states and 17522 transitions. [2022-03-15 14:17:23,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 14:17:23,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2022-03-15 14:17:23,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:17:23,333 INFO L225 Difference]: With dead ends: 4994 [2022-03-15 14:17:23,334 INFO L226 Difference]: Without dead ends: 4984 [2022-03-15 14:17:23,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=59, Unknown=0, NotChecked=0, Total=110 [2022-03-15 14:17:23,339 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 249 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 14:17:23,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 379 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 14:17:23,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4984 states. [2022-03-15 14:17:23,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4984 to 4979. [2022-03-15 14:17:23,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4979 states, 4978 states have (on average 3.5168742466854157) internal successors, (17507), 4978 states have internal predecessors, (17507), 0 states have call successors, (0), 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-15 14:17:23,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4979 states to 4979 states and 17507 transitions. [2022-03-15 14:17:23,510 INFO L78 Accepts]: Start accepts. Automaton has 4979 states and 17507 transitions. Word has length 109 [2022-03-15 14:17:23,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:17:23,510 INFO L470 AbstractCegarLoop]: Abstraction has 4979 states and 17507 transitions. [2022-03-15 14:17:23,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 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-15 14:17:23,510 INFO L276 IsEmpty]: Start isEmpty. Operand 4979 states and 17507 transitions. [2022-03-15 14:17:23,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-03-15 14:17:23,527 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:17:23,527 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] [2022-03-15 14:17:23,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 14:17:23,528 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:17:23,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:17:23,529 INFO L85 PathProgramCache]: Analyzing trace with hash 629906956, now seen corresponding path program 1 times [2022-03-15 14:17:23,529 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:17:23,529 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703005741] [2022-03-15 14:17:23,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:17:23,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:17:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:17:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:17:23,655 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:17:23,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703005741] [2022-03-15 14:17:23,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703005741] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:17:23,656 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200103144] [2022-03-15 14:17:23,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:17:23,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:17:23,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:17:23,657 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-15 14:17:23,658 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-15 14:17:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:17:23,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 14:17:23,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:17:24,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:17:24,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:17:24,402 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-15 14:17:24,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200103144] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 14:17:24,403 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 14:17:24,403 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-03-15 14:17:24,403 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064812364] [2022-03-15 14:17:24,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:17:24,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 14:17:24,404 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:17:24,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 14:17:24,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-03-15 14:17:24,404 INFO L87 Difference]: Start difference. First operand 4979 states and 17507 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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-15 14:17:24,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:17:24,502 INFO L93 Difference]: Finished difference Result 5483 states and 19328 transitions. [2022-03-15 14:17:24,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 14:17:24,503 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2022-03-15 14:17:24,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:17:24,520 INFO L225 Difference]: With dead ends: 5483 [2022-03-15 14:17:24,520 INFO L226 Difference]: Without dead ends: 5483 [2022-03-15 14:17:24,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 224 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-15 14:17:24,521 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 190 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:17:24,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 383 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 14:17:24,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2022-03-15 14:17:24,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5483. [2022-03-15 14:17:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5483 states, 5482 states have (on average 3.5257205399489235) internal successors, (19328), 5482 states have internal predecessors, (19328), 0 states have call successors, (0), 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-15 14:17:24,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5483 states to 5483 states and 19328 transitions. [2022-03-15 14:17:24,670 INFO L78 Accepts]: Start accepts. Automaton has 5483 states and 19328 transitions. Word has length 116 [2022-03-15 14:17:24,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:17:24,670 INFO L470 AbstractCegarLoop]: Abstraction has 5483 states and 19328 transitions. [2022-03-15 14:17:24,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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-15 14:17:24,671 INFO L276 IsEmpty]: Start isEmpty. Operand 5483 states and 19328 transitions. [2022-03-15 14:17:24,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-03-15 14:17:24,688 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:17:24,688 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-15 14:17:24,730 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-15 14:17:24,914 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-15 14:17:24,914 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:17:24,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:17:24,915 INFO L85 PathProgramCache]: Analyzing trace with hash 310973555, now seen corresponding path program 1 times [2022-03-15 14:17:24,915 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:17:24,915 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068291388] [2022-03-15 14:17:24,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:17:24,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:17:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:17:25,045 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-15 14:17:25,045 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:17:25,046 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068291388] [2022-03-15 14:17:25,046 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068291388] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:17:25,046 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638200591] [2022-03-15 14:17:25,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:17:25,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:17:25,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:17:25,047 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-15 14:17:25,048 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-15 14:17:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:17:25,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 14:17:25,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:17:25,417 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-15 14:17:25,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:17:25,701 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-15 14:17:25,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638200591] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 14:17:25,702 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 14:17:25,702 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-03-15 14:17:25,702 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381700397] [2022-03-15 14:17:25,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:17:25,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 14:17:25,703 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:17:25,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 14:17:25,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-03-15 14:17:25,703 INFO L87 Difference]: Start difference. First operand 5483 states and 19328 transitions. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 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-15 14:17:25,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:17:25,916 INFO L93 Difference]: Finished difference Result 8369 states and 29751 transitions. [2022-03-15 14:17:25,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 14:17:25,916 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 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-15 14:17:25,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:17:25,943 INFO L225 Difference]: With dead ends: 8369 [2022-03-15 14:17:25,943 INFO L226 Difference]: Without dead ends: 8369 [2022-03-15 14:17:25,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 232 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2022-03-15 14:17:25,944 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 538 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 14:17:25,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [538 Valid, 694 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 14:17:25,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8369 states. [2022-03-15 14:17:26,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8369 to 5615. [2022-03-15 14:17:26,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5615 states, 5614 states have (on average 3.521197007481297) internal successors, (19768), 5614 states have internal predecessors, (19768), 0 states have call successors, (0), 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-15 14:17:26,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5615 states to 5615 states and 19768 transitions. [2022-03-15 14:17:26,174 INFO L78 Accepts]: Start accepts. Automaton has 5615 states and 19768 transitions. Word has length 121 [2022-03-15 14:17:26,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:17:26,174 INFO L470 AbstractCegarLoop]: Abstraction has 5615 states and 19768 transitions. [2022-03-15 14:17:26,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 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-15 14:17:26,175 INFO L276 IsEmpty]: Start isEmpty. Operand 5615 states and 19768 transitions. [2022-03-15 14:17:26,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-03-15 14:17:26,191 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:17:26,191 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-15 14:17:26,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-15 14:17:26,421 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-15 14:17:26,421 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:17:26,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:17:26,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1142457735, now seen corresponding path program 2 times [2022-03-15 14:17:26,422 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:17:26,422 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312706833] [2022-03-15 14:17:26,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:17:26,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:17:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:17:26,544 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-15 14:17:26,544 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:17:26,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312706833] [2022-03-15 14:17:26,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312706833] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:17:26,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584174463] [2022-03-15 14:17:26,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 14:17:26,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:17:26,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:17:26,560 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-15 14:17:26,561 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-15 14:17:26,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 14:17:26,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:17:26,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 14:17:26,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:17:27,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 14:17:27,008 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 14:17:27,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584174463] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:17:27,008 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 14:17:27,009 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-03-15 14:17:27,009 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361558087] [2022-03-15 14:17:27,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:17:27,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 14:17:27,010 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:17:27,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 14:17:27,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-03-15 14:17:27,011 INFO L87 Difference]: Start difference. First operand 5615 states and 19768 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-15 14:17:27,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:17:27,177 INFO L93 Difference]: Finished difference Result 5306 states and 18640 transitions. [2022-03-15 14:17:27,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 14:17:27,178 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-15 14:17:27,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:17:27,196 INFO L225 Difference]: With dead ends: 5306 [2022-03-15 14:17:27,196 INFO L226 Difference]: Without dead ends: 5306 [2022-03-15 14:17:27,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-03-15 14:17:27,198 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 185 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:17:27,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 412 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 14:17:27,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5306 states. [2022-03-15 14:17:27,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5306 to 4584. [2022-03-15 14:17:27,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4584 states, 4583 states have (on average 3.5339297403447523) internal successors, (16196), 4583 states have internal predecessors, (16196), 0 states have call successors, (0), 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-15 14:17:27,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4584 states to 4584 states and 16196 transitions. [2022-03-15 14:17:27,323 INFO L78 Accepts]: Start accepts. Automaton has 4584 states and 16196 transitions. Word has length 121 [2022-03-15 14:17:27,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:17:27,324 INFO L470 AbstractCegarLoop]: Abstraction has 4584 states and 16196 transitions. [2022-03-15 14:17:27,325 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-15 14:17:27,325 INFO L276 IsEmpty]: Start isEmpty. Operand 4584 states and 16196 transitions. [2022-03-15 14:17:27,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-03-15 14:17:27,365 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:17:27,365 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-15 14:17:27,384 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-15 14:17:27,579 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-15 14:17:27,579 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:17:27,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:17:27,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1101298630, now seen corresponding path program 1 times [2022-03-15 14:17:27,580 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:17:27,580 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065299023] [2022-03-15 14:17:27,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:17:27,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:17:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:17:28,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:17:28,530 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:17:28,530 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065299023] [2022-03-15 14:17:28,530 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065299023] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:17:28,530 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042071328] [2022-03-15 14:17:28,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:17:28,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:17:28,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:17:28,548 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-15 14:17:28,575 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-15 14:17:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:17:28,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 14:17:28,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:17:28,765 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-15 14:17:28,805 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-15 14:17:28,805 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 18 [2022-03-15 14:17:29,277 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 14:17:29,278 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 15 [2022-03-15 14:17:30,732 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 27 treesize of output 27 [2022-03-15 14:17:30,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:17:31,002 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 27 treesize of output 27 [2022-03-15 14:17:31,216 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 14:17:31,218 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:17:31,218 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 55 treesize of output 32 [2022-03-15 14:17:31,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:17:31,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:17:31,731 WARN L838 $PredicateComparison]: unable to prove that (and (or (= c_~min1~0 c_~min3~0) (not (< c_~min3~0 c_~min2~0)) (forall ((v_ArrVal_174 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_174) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min3~0))) (forall ((v_ArrVal_174 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_174) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< .cse0 c_~min2~0)) (= c_~min1~0 .cse0) (not (< .cse0 c_~min3~0)))))) is different from false [2022-03-15 14:17:31,905 WARN L838 $PredicateComparison]: unable to prove that (and (or (= c_~min1~0 c_~min3~0) (not (< c_~min3~0 c_~min2~0)) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_174) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min3~0))) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_174) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< .cse0 c_~min3~0)) (= c_~min1~0 .cse0) (not (< .cse0 c_~min2~0)))))) is different from false [2022-03-15 14:17:32,053 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:17:32,054 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 335 treesize of output 295 [2022-03-15 14:17:32,059 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 256 treesize of output 220 [2022-03-15 14:17:32,063 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 220 treesize of output 208 [2022-03-15 14:17:32,067 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 208 treesize of output 202 [2022-03-15 14:17:32,072 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 202 treesize of output 184 [2022-03-15 14:17:35,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 14:17:35,574 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 10 treesize of output 8 [2022-03-15 14:17:35,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-15 14:17:35,737 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042071328] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:17:35,737 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:17:35,737 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31, 31] total 85 [2022-03-15 14:17:35,738 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198300924] [2022-03-15 14:17:35,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:17:35,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-03-15 14:17:35,740 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:17:35,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-03-15 14:17:35,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=813, Invalid=5999, Unknown=2, NotChecked=326, Total=7140 [2022-03-15 14:17:35,744 INFO L87 Difference]: Start difference. First operand 4584 states and 16196 transitions. Second operand has 85 states, 85 states have (on average 4.0588235294117645) internal successors, (345), 85 states have internal predecessors, (345), 0 states have call successors, (0), 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-15 14:17:42,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:17:42,421 INFO L93 Difference]: Finished difference Result 23682 states and 83992 transitions. [2022-03-15 14:17:42,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-03-15 14:17:42,422 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 4.0588235294117645) internal successors, (345), 85 states have internal predecessors, (345), 0 states have call successors, (0), 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-15 14:17:42,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:17:42,512 INFO L225 Difference]: With dead ends: 23682 [2022-03-15 14:17:42,512 INFO L226 Difference]: Without dead ends: 23652 [2022-03-15 14:17:42,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 201 SyntacticMatches, 4 SemanticMatches, 150 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 7755 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=2840, Invalid=19515, Unknown=3, NotChecked=594, Total=22952 [2022-03-15 14:17:42,518 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 3378 mSDsluCounter, 6761 mSDsCounter, 0 mSdLazyCounter, 3711 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3378 SdHoareTripleChecker+Valid, 6303 SdHoareTripleChecker+Invalid, 5632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 3711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1759 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 14:17:42,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3378 Valid, 6303 Invalid, 5632 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [162 Valid, 3711 Invalid, 0 Unknown, 1759 Unchecked, 1.7s Time] [2022-03-15 14:17:42,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23652 states. [2022-03-15 14:17:42,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23652 to 8846. [2022-03-15 14:17:42,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8846 states, 8845 states have (on average 3.572074618428491) internal successors, (31595), 8845 states have internal predecessors, (31595), 0 states have call successors, (0), 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-15 14:17:42,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8846 states to 8846 states and 31595 transitions. [2022-03-15 14:17:42,827 INFO L78 Accepts]: Start accepts. Automaton has 8846 states and 31595 transitions. Word has length 126 [2022-03-15 14:17:42,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:17:42,827 INFO L470 AbstractCegarLoop]: Abstraction has 8846 states and 31595 transitions. [2022-03-15 14:17:42,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 4.0588235294117645) internal successors, (345), 85 states have internal predecessors, (345), 0 states have call successors, (0), 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-15 14:17:42,828 INFO L276 IsEmpty]: Start isEmpty. Operand 8846 states and 31595 transitions. [2022-03-15 14:17:42,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-03-15 14:17:42,849 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:17:42,850 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-15 14:17:42,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-15 14:17:43,063 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-15 14:17:43,063 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:17:43,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:17:43,064 INFO L85 PathProgramCache]: Analyzing trace with hash 493654544, now seen corresponding path program 1 times [2022-03-15 14:17:43,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:17:43,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919815526] [2022-03-15 14:17:43,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:17:43,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:17:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:17:43,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:17:43,945 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:17:43,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919815526] [2022-03-15 14:17:43,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919815526] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:17:43,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261617676] [2022-03-15 14:17:43,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:17:43,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:17:43,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:17:43,947 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-15 14:17:43,948 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-15 14:17:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:17:44,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 14:17:44,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:17:44,100 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-15 14:17:44,135 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-15 14:17:44,136 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 18 [2022-03-15 14:17:44,249 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-15 14:17:44,249 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 16 treesize of output 22 [2022-03-15 14:17:44,766 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 14:17:44,766 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 18 [2022-03-15 14:17:44,954 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 14:17:45,494 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-15 14:17:45,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:17:45,959 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 35 treesize of output 33 [2022-03-15 14:17:46,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:17:46,325 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 35 treesize of output 33 [2022-03-15 14:17:46,576 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:17:46,577 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 69 treesize of output 45 [2022-03-15 14:17:47,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:17:47,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:17:49,693 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (or (and (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse0 c_~min3~0)) (< .cse0 c_~min2~0)))) (or (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0)) (< c_~min3~0 c_~min2~0))) (< 0 ~M~0) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) c_~A~0.base) c_~A~0.offset))) (let ((.cse1 (< .cse2 c_~min1~0))) (and (or (= c_~min2~0 c_~min1~0) .cse1) (or (not .cse1) (= c_~min2~0 .cse2))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:17:56,434 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (or (< 0 ~M~0) (and (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (not (< .cse0 c_~min3~0)) (< .cse0 c_~min2~0)))) (or (< c_~min3~0 c_~min2~0) (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min3~0)))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (let ((.cse2 (< .cse1 c_~min1~0))) (and (or (= c_~min2~0 .cse1) (not .cse2)) (or (= c_~min2~0 c_~min1~0) .cse2)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:17:57,798 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (or (and (or (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0)) (< c_~min3~0 c_~min2~0)) (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< .cse0 c_~min2~0) (not (< .cse0 c_~min3~0)))))) (< 0 ~M~0) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (let ((.cse1 (< .cse2 c_~min1~0))) (and (or (not .cse1) (= c_~min2~0 .cse2)) (or (= c_~min2~0 c_~min1~0) .cse1)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:17:58,544 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (or (< 0 ~M~0) (and (or (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0)) (< c_~min3~0 c_~min2~0)) (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse0 c_~min3~0)) (< .cse0 c_~min2~0))))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse1 (< .cse2 c_~min1~0))) (and (or (not .cse1) (= c_~min2~0 .cse2)) (or (= c_~min2~0 c_~min1~0) .cse1)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:18:01,468 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:18:01,468 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 177 treesize of output 117 [2022-03-15 14:18:01,488 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:18:01,489 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 1939 treesize of output 1863 [2022-03-15 14:18:01,508 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:18:01,509 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1863 treesize of output 1797 [2022-03-15 14:18:01,533 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 1686 treesize of output 1590 [2022-03-15 14:18:01,546 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 1590 treesize of output 1398 [2022-03-15 14:18:01,559 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 1398 treesize of output 1350 [2022-03-15 14:18:01,574 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 1350 treesize of output 1254 [2022-03-15 14:18:06,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:18:06,057 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261617676] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:18:06,057 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:18:06,058 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 35, 36] total 90 [2022-03-15 14:18:06,058 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387477517] [2022-03-15 14:18:06,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:18:06,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-03-15 14:18:06,058 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:18:06,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-03-15 14:18:06,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1113, Invalid=6196, Unknown=17, NotChecked=684, Total=8010 [2022-03-15 14:18:06,061 INFO L87 Difference]: Start difference. First operand 8846 states and 31595 transitions. Second operand has 90 states, 90 states have (on average 3.7222222222222223) internal successors, (335), 90 states have internal predecessors, (335), 0 states have call successors, (0), 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-15 14:18:09,350 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (or (< 0 ~M~0) (and (or (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0)) (< c_~min3~0 c_~min2~0)) (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse1 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse1 c_~min3~0)) (< .cse1 c_~min2~0))))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse2 (< .cse3 c_~min1~0))) (and (or (not .cse2) (= c_~min2~0 .cse3)) (or (= c_~min2~0 c_~min1~0) .cse2)))) (< (+ ~M~0 1) c_~N~0))))) (and (or (< |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0) .cse0)) is different from false [2022-03-15 14:18:29,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:18:29,166 INFO L93 Difference]: Finished difference Result 25483 states and 90196 transitions. [2022-03-15 14:18:29,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-03-15 14:18:29,167 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 90 states have (on average 3.7222222222222223) internal successors, (335), 90 states have internal predecessors, (335), 0 states have call successors, (0), 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-15 14:18:29,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:18:29,242 INFO L225 Difference]: With dead ends: 25483 [2022-03-15 14:18:29,242 INFO L226 Difference]: Without dead ends: 25179 [2022-03-15 14:18:29,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 211 SyntacticMatches, 33 SemanticMatches, 185 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 15007 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=4954, Invalid=27947, Unknown=61, NotChecked=1820, Total=34782 [2022-03-15 14:18:29,248 INFO L933 BasicCegarLoop]: 391 mSDtfsCounter, 3128 mSDsluCounter, 14861 mSDsCounter, 0 mSdLazyCounter, 4926 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3128 SdHoareTripleChecker+Valid, 13467 SdHoareTripleChecker+Invalid, 13498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 4926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8425 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 14:18:29,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3128 Valid, 13467 Invalid, 13498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 4926 Invalid, 0 Unknown, 8425 Unchecked, 2.1s Time] [2022-03-15 14:18:29,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25179 states. [2022-03-15 14:18:29,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25179 to 12550. [2022-03-15 14:18:29,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12550 states, 12549 states have (on average 3.540361781815284) internal successors, (44428), 12549 states have internal predecessors, (44428), 0 states have call successors, (0), 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-15 14:18:29,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12550 states to 12550 states and 44428 transitions. [2022-03-15 14:18:29,618 INFO L78 Accepts]: Start accepts. Automaton has 12550 states and 44428 transitions. Word has length 126 [2022-03-15 14:18:29,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:18:29,619 INFO L470 AbstractCegarLoop]: Abstraction has 12550 states and 44428 transitions. [2022-03-15 14:18:29,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 90 states have (on average 3.7222222222222223) internal successors, (335), 90 states have internal predecessors, (335), 0 states have call successors, (0), 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-15 14:18:29,619 INFO L276 IsEmpty]: Start isEmpty. Operand 12550 states and 44428 transitions. [2022-03-15 14:18:29,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-03-15 14:18:29,646 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:18:29,646 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-15 14:18:29,664 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-15 14:18:29,859 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-15 14:18:29,859 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:18:29,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:18:29,860 INFO L85 PathProgramCache]: Analyzing trace with hash 610984820, now seen corresponding path program 2 times [2022-03-15 14:18:29,860 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:18:29,860 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409620724] [2022-03-15 14:18:29,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:18:29,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:18:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:18:30,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:18:30,829 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:18:30,829 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409620724] [2022-03-15 14:18:30,829 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409620724] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:18:30,829 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168682789] [2022-03-15 14:18:30,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 14:18:30,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:18:30,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:18:30,830 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-15 14:18:30,831 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-15 14:18:30,920 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 14:18:30,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:18:30,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 52 conjunts are in the unsatisfiable core [2022-03-15 14:18:30,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:18:31,004 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-15 14:18:31,044 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-15 14:18:31,044 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-15 14:18:31,298 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-15 14:18:31,299 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-15 14:18:32,024 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 35 treesize of output 33 [2022-03-15 14:18:32,343 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 35 treesize of output 33 [2022-03-15 14:18:32,516 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:18:32,517 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 69 treesize of output 45 [2022-03-15 14:18:33,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:18:33,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:18:34,409 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:18:34,409 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 337 treesize of output 297 [2022-03-15 14:18:34,414 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 258 treesize of output 234 [2022-03-15 14:18:34,418 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 234 treesize of output 210 [2022-03-15 14:18:34,422 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 210 treesize of output 198 [2022-03-15 14:18:34,427 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 198 treesize of output 186 [2022-03-15 14:18:35,723 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 13 treesize of output 11 [2022-03-15 14:18:35,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:18:35,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168682789] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:18:35,793 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:18:35,793 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 27] total 73 [2022-03-15 14:18:35,793 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138549442] [2022-03-15 14:18:35,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:18:35,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-03-15 14:18:35,794 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:18:35,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-03-15 14:18:35,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=866, Invalid=4382, Unknown=8, NotChecked=0, Total=5256 [2022-03-15 14:18:35,796 INFO L87 Difference]: Start difference. First operand 12550 states and 44428 transitions. Second operand has 73 states, 73 states have (on average 4.589041095890411) internal successors, (335), 73 states have internal predecessors, (335), 0 states have call successors, (0), 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-15 14:18:42,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:18:42,348 INFO L93 Difference]: Finished difference Result 28368 states and 99557 transitions. [2022-03-15 14:18:42,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-03-15 14:18:42,348 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 4.589041095890411) internal successors, (335), 73 states have internal predecessors, (335), 0 states have call successors, (0), 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-15 14:18:42,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:18:42,432 INFO L225 Difference]: With dead ends: 28368 [2022-03-15 14:18:42,432 INFO L226 Difference]: Without dead ends: 28345 [2022-03-15 14:18:42,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 221 SyntacticMatches, 3 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8513 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=3485, Invalid=21625, Unknown=12, NotChecked=0, Total=25122 [2022-03-15 14:18:42,435 INFO L933 BasicCegarLoop]: 306 mSDtfsCounter, 3076 mSDsluCounter, 9113 mSDsCounter, 0 mSdLazyCounter, 4293 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3076 SdHoareTripleChecker+Valid, 8652 SdHoareTripleChecker+Invalid, 6417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 4293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1966 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 14:18:42,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3076 Valid, 8652 Invalid, 6417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 4293 Invalid, 0 Unknown, 1966 Unchecked, 1.7s Time] [2022-03-15 14:18:42,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28345 states. [2022-03-15 14:18:42,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28345 to 13994. [2022-03-15 14:18:42,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13994 states, 13993 states have (on average 3.5457014221396412) internal successors, (49615), 13993 states have internal predecessors, (49615), 0 states have call successors, (0), 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-15 14:18:42,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13994 states to 13994 states and 49615 transitions. [2022-03-15 14:18:42,927 INFO L78 Accepts]: Start accepts. Automaton has 13994 states and 49615 transitions. Word has length 126 [2022-03-15 14:18:42,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:18:42,927 INFO L470 AbstractCegarLoop]: Abstraction has 13994 states and 49615 transitions. [2022-03-15 14:18:42,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 4.589041095890411) internal successors, (335), 73 states have internal predecessors, (335), 0 states have call successors, (0), 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-15 14:18:42,927 INFO L276 IsEmpty]: Start isEmpty. Operand 13994 states and 49615 transitions. [2022-03-15 14:18:42,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-03-15 14:18:42,956 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:18:42,956 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-15 14:18:42,972 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-15 14:18:43,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:18:43,172 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:18:43,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:18:43,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1799420520, now seen corresponding path program 3 times [2022-03-15 14:18:43,172 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:18:43,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430468142] [2022-03-15 14:18:43,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:18:43,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:18:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:18:43,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:18:43,833 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:18:43,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430468142] [2022-03-15 14:18:43,833 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430468142] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:18:43,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601576061] [2022-03-15 14:18:43,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 14:18:43,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:18:43,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:18:43,834 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-15 14:18:43,835 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-15 14:18:43,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 14:18:43,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:18:43,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-15 14:18:43,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:18:43,997 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-15 14:18:44,161 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 14:18:44,162 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-03-15 14:18:44,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:18:44,732 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 35 treesize of output 33 [2022-03-15 14:18:44,887 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 35 treesize of output 33 [2022-03-15 14:18:45,186 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:18:45,186 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 63 treesize of output 43 [2022-03-15 14:18:45,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:18:45,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:18:46,801 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:18:46,801 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 419 treesize of output 371 [2022-03-15 14:18:46,807 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 332 treesize of output 320 [2022-03-15 14:18:46,812 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 320 treesize of output 314 [2022-03-15 14:18:46,817 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 314 treesize of output 290 [2022-03-15 14:18:46,845 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 290 treesize of output 242 [2022-03-15 14:18:48,187 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 10 treesize of output 8 [2022-03-15 14:18:48,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:18:48,290 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601576061] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:18:48,290 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:18:48,291 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 27, 27] total 72 [2022-03-15 14:18:48,291 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611459265] [2022-03-15 14:18:48,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:18:48,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-03-15 14:18:48,291 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:18:48,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-03-15 14:18:48,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=973, Invalid=4129, Unknown=10, NotChecked=0, Total=5112 [2022-03-15 14:18:48,292 INFO L87 Difference]: Start difference. First operand 13994 states and 49615 transitions. Second operand has 72 states, 72 states have (on average 4.625) internal successors, (333), 72 states have internal predecessors, (333), 0 states have call successors, (0), 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-15 14:18:57,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:18:57,879 INFO L93 Difference]: Finished difference Result 30614 states and 107459 transitions. [2022-03-15 14:18:57,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2022-03-15 14:18:57,879 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 4.625) internal successors, (333), 72 states have internal predecessors, (333), 0 states have call successors, (0), 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-15 14:18:57,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:18:57,970 INFO L225 Difference]: With dead ends: 30614 [2022-03-15 14:18:57,970 INFO L226 Difference]: Without dead ends: 30563 [2022-03-15 14:18:57,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 221 SyntacticMatches, 2 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13122 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=4996, Invalid=30902, Unknown=12, NotChecked=0, Total=35910 [2022-03-15 14:18:57,979 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 3122 mSDsluCounter, 10233 mSDsCounter, 0 mSdLazyCounter, 5538 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3122 SdHoareTripleChecker+Valid, 9545 SdHoareTripleChecker+Invalid, 7767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 5538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2083 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 14:18:57,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3122 Valid, 9545 Invalid, 7767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 5538 Invalid, 0 Unknown, 2083 Unchecked, 2.2s Time] [2022-03-15 14:18:58,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30563 states. [2022-03-15 14:18:58,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30563 to 11764. [2022-03-15 14:18:58,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11764 states, 11763 states have (on average 3.573153107200544) internal successors, (42031), 11763 states have internal predecessors, (42031), 0 states have call successors, (0), 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-15 14:18:58,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11764 states to 11764 states and 42031 transitions. [2022-03-15 14:18:58,466 INFO L78 Accepts]: Start accepts. Automaton has 11764 states and 42031 transitions. Word has length 126 [2022-03-15 14:18:58,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:18:58,466 INFO L470 AbstractCegarLoop]: Abstraction has 11764 states and 42031 transitions. [2022-03-15 14:18:58,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 4.625) internal successors, (333), 72 states have internal predecessors, (333), 0 states have call successors, (0), 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-15 14:18:58,467 INFO L276 IsEmpty]: Start isEmpty. Operand 11764 states and 42031 transitions. [2022-03-15 14:18:58,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-03-15 14:18:58,512 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:18:58,512 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-15 14:18:58,531 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-15 14:18:58,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:18:58,731 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:18:58,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:18:58,732 INFO L85 PathProgramCache]: Analyzing trace with hash 894416540, now seen corresponding path program 2 times [2022-03-15 14:18:58,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:18:58,732 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742285232] [2022-03-15 14:18:58,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:18:58,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:18:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:18:59,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:18:59,567 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:18:59,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742285232] [2022-03-15 14:18:59,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742285232] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:18:59,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220337337] [2022-03-15 14:18:59,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 14:18:59,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:18:59,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:18:59,569 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-15 14:18:59,570 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-15 14:18:59,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 14:18:59,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:18:59,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-15 14:18:59,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:18:59,855 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-15 14:18:59,894 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-15 14:18:59,895 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 18 [2022-03-15 14:19:00,256 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 14:19:00,257 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 15 [2022-03-15 14:19:00,412 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-15 14:19:00,715 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-15 14:19:00,891 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-15 14:19:01,117 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-15 14:19:01,511 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:19:01,613 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:19:01,614 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 72 treesize of output 48 [2022-03-15 14:19:01,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:19:01,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:19:03,176 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (and (forall ((v_ArrVal_324 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_324) c_~A~0.base))) (let ((.cse0 (select .cse3 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse0 c_~min3~0)) (let ((.cse2 (select .cse3 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (let ((.cse1 (< .cse2 c_~min1~0))) (and (or (= c_~min1~0 .cse0) .cse1) (or (not .cse1) (= .cse0 .cse2))))) (not (< .cse0 c_~min2~0)))))) (or (forall ((v_ArrVal_324 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_324) c_~A~0.base))) (or (< (select .cse4 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (let ((.cse6 (select .cse4 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (let ((.cse5 (< .cse6 c_~min1~0))) (and (or (not .cse5) (= c_~min3~0 .cse6)) (or .cse5 (= c_~min1~0 c_~min3~0)))))))) (not (< c_~min3~0 c_~min2~0)))) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0))) is different from false [2022-03-15 14:19:03,979 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (< 0 ~M~0) (and (forall ((v_ArrVal_324 (Array Int Int)) (v_ArrVal_323 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_324) c_~A~0.base))) (let ((.cse0 (select .cse3 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse0 c_~min2~0)) (let ((.cse2 (select .cse3 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (let ((.cse1 (< .cse2 c_~min1~0))) (and (or .cse1 (= c_~min1~0 .cse0)) (or (= .cse0 .cse2) (not .cse1))))) (not (< .cse0 c_~min3~0)))))) (or (not (< c_~min3~0 c_~min2~0)) (forall ((v_ArrVal_324 (Array Int Int)) (v_ArrVal_323 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_324) c_~A~0.base))) (or (< (select .cse4 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (let ((.cse5 (select .cse4 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (let ((.cse6 (< .cse5 c_~min1~0))) (and (or (= .cse5 c_~min3~0) (not .cse6)) (or .cse6 (= c_~min1~0 c_~min3~0)))))))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-15 14:19:05,079 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ ~M~0 1) c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (and (forall ((v_ArrVal_324 (Array Int Int)) (v_ArrVal_323 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_324) c_~A~0.base))) (let ((.cse0 (select .cse3 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse0 c_~min2~0)) (let ((.cse2 (select .cse3 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (let ((.cse1 (< .cse2 c_~min1~0))) (and (or .cse1 (= c_~min1~0 .cse0)) (or (= .cse0 .cse2) (not .cse1))))) (not (< .cse0 c_~min3~0)))))) (or (not (< c_~min3~0 c_~min2~0)) (forall ((v_ArrVal_324 (Array Int Int)) (v_ArrVal_323 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_324) c_~A~0.base))) (or (< (select .cse4 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (let ((.cse5 (select .cse4 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (let ((.cse6 (< .cse5 c_~min1~0))) (and (or (= .cse5 c_~min3~0) (not .cse6)) (or .cse6 (= c_~min1~0 c_~min3~0)))))))))))) is different from false [2022-03-15 14:19:10,983 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:19:10,983 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 256 treesize of output 173 [2022-03-15 14:19:11,014 INFO L353 Elim1Store]: treesize reduction 26, result has 36.6 percent of original size [2022-03-15 14:19:11,014 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 5365 treesize of output 5155 [2022-03-15 14:19:11,107 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 14:19:11,107 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5136 treesize of output 5061 [2022-03-15 14:19:11,171 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 14:19:11,172 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5056 treesize of output 4677 [2022-03-15 14:19:11,231 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 14:19:11,231 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4672 treesize of output 4485 [2022-03-15 14:19:11,301 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 14:19:11,301 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4480 treesize of output 4389 [2022-03-15 14:19:11,361 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 14:19:11,361 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4384 treesize of output 4349 [2022-03-15 14:19:11,421 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 14:19:11,422 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4344 treesize of output 4189 [2022-03-15 14:19:11,490 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-15 14:19:11,509 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-15 14:19:11,706 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,SelfDestructingSolverStorable10 [2022-03-15 14:19:11,707 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-03-15 14:19:11,713 INFO L158 Benchmark]: Toolchain (without parser) took 111169.45ms. Allocated memory was 165.7MB in the beginning and 1.1GB in the end (delta: 932.2MB). Free memory was 118.2MB in the beginning and 334.6MB in the end (delta: -216.4MB). Peak memory consumption was 865.5MB. Max. memory is 8.0GB. [2022-03-15 14:19:11,713 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 165.7MB. Free memory is still 134.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 14:19:11,713 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.33ms. Allocated memory is still 165.7MB. Free memory was 118.0MB in the beginning and 142.9MB in the end (delta: -24.9MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-03-15 14:19:11,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.80ms. Allocated memory is still 165.7MB. Free memory was 142.9MB in the beginning and 140.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 14:19:11,714 INFO L158 Benchmark]: Boogie Preprocessor took 30.76ms. Allocated memory is still 165.7MB. Free memory was 140.9MB in the beginning and 139.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 14:19:11,714 INFO L158 Benchmark]: RCFGBuilder took 380.71ms. Allocated memory is still 165.7MB. Free memory was 139.5MB in the beginning and 121.0MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-03-15 14:19:11,714 INFO L158 Benchmark]: TraceAbstraction took 110469.88ms. Allocated memory was 165.7MB in the beginning and 1.1GB in the end (delta: 932.2MB). Free memory was 120.7MB in the beginning and 334.6MB in the end (delta: -213.9MB). Peak memory consumption was 868.8MB. Max. memory is 8.0GB. [2022-03-15 14:19:11,718 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 165.7MB. Free memory is still 134.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 243.33ms. Allocated memory is still 165.7MB. Free memory was 118.0MB in the beginning and 142.9MB in the end (delta: -24.9MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.80ms. Allocated memory is still 165.7MB. Free memory was 142.9MB in the beginning and 140.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.76ms. Allocated memory is still 165.7MB. Free memory was 140.9MB in the beginning and 139.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 380.71ms. Allocated memory is still 165.7MB. Free memory was 139.5MB in the beginning and 121.0MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 110469.88ms. Allocated memory was 165.7MB in the beginning and 1.1GB in the end (delta: 932.2MB). Free memory was 120.7MB in the beginning and 334.6MB in the end (delta: -213.9MB). Peak memory consumption was 868.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-15 14:19:11,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...