/usr/bin/java -Xmx16000000000 -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-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bc79526 [2022-01-18 12:21:58,608 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 12:21:58,610 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 12:21:58,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 12:21:58,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 12:21:58,674 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 12:21:58,675 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 12:21:58,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 12:21:58,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 12:21:58,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 12:21:58,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 12:21:58,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 12:21:58,685 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 12:21:58,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 12:21:58,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 12:21:58,699 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 12:21:58,700 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 12:21:58,701 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 12:21:58,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 12:21:58,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 12:21:58,707 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 12:21:58,710 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 12:21:58,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 12:21:58,711 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 12:21:58,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 12:21:58,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 12:21:58,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 12:21:58,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 12:21:58,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 12:21:58,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 12:21:58,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 12:21:58,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 12:21:58,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 12:21:58,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 12:21:58,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 12:21:58,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 12:21:58,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 12:21:58,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 12:21:58,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 12:21:58,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 12:21:58,727 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 12:21:58,728 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-Separate.epf [2022-01-18 12:21:58,758 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 12:21:58,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 12:21:58,758 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-18 12:21:58,759 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-18 12:21:58,759 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 12:21:58,759 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 12:21:58,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 12:21:58,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 12:21:58,760 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 12:21:58,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 12:21:58,761 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 12:21:58,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 12:21:58,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 12:21:58,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 12:21:58,761 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 12:21:58,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 12:21:58,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 12:21:58,762 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 12:21:58,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 12:21:58,762 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 12:21:58,762 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 12:21:58,762 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 12:21:58,762 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 12:21:58,762 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 12:21:58,764 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 12:21:58,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 12:21:58,764 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 12:21:58,764 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 12:21:58,764 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 12:21:58,764 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 12:21:58,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 12:21:58,765 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 12:21:58,765 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-18 12:21:58,765 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2022-01-18 12:21:58,765 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-01-18 12:21:58,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 12:21:59,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 12:21:59,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 12:21:59,010 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 12:21:59,010 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 12:21:59,011 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c [2022-01-18 12:21:59,058 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22ac1319e/3a70ace2343a4dda87cadc29da2998f6/FLAG29aa026b2 [2022-01-18 12:21:59,473 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 12:21:59,474 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c [2022-01-18 12:21:59,484 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22ac1319e/3a70ace2343a4dda87cadc29da2998f6/FLAG29aa026b2 [2022-01-18 12:21:59,865 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22ac1319e/3a70ace2343a4dda87cadc29da2998f6 [2022-01-18 12:21:59,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 12:21:59,868 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 12:21:59,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 12:21:59,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 12:21:59,872 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 12:21:59,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 12:21:59" (1/1) ... [2022-01-18 12:21:59,874 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37b4dded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:21:59, skipping insertion in model container [2022-01-18 12:21:59,874 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 12:21:59" (1/1) ... [2022-01-18 12:21:59,879 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 12:21:59,893 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 12:22:00,092 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-array-sum-alt.wvr.c[2761,2774] [2022-01-18 12:22:00,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 12:22:00,120 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 12:22:00,155 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-array-sum-alt.wvr.c[2761,2774] [2022-01-18 12:22:00,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 12:22:00,180 INFO L208 MainTranslator]: Completed translation [2022-01-18 12:22:00,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:22:00 WrapperNode [2022-01-18 12:22:00,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 12:22:00,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 12:22:00,182 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 12:22:00,182 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 12:22:00,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:22:00" (1/1) ... [2022-01-18 12:22:00,203 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:22:00" (1/1) ... [2022-01-18 12:22:00,239 INFO L137 Inliner]: procedures = 25, calls = 51, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 200 [2022-01-18 12:22:00,239 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 12:22:00,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 12:22:00,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 12:22:00,240 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 12:22:00,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:22:00" (1/1) ... [2022-01-18 12:22:00,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:22:00" (1/1) ... [2022-01-18 12:22:00,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:22:00" (1/1) ... [2022-01-18 12:22:00,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:22:00" (1/1) ... [2022-01-18 12:22:00,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:22:00" (1/1) ... [2022-01-18 12:22:00,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:22:00" (1/1) ... [2022-01-18 12:22:00,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:22:00" (1/1) ... [2022-01-18 12:22:00,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 12:22:00,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 12:22:00,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 12:22:00,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 12:22:00,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:22:00" (1/1) ... [2022-01-18 12:22:00,298 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 12:22:00,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:22:00,320 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-01-18 12:22:00,347 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-01-18 12:22:00,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 12:22:00,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 12:22:00,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 12:22:00,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-18 12:22:00,361 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-18 12:22:00,361 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-18 12:22:00,361 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-18 12:22:00,361 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-18 12:22:00,361 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-18 12:22:00,361 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-18 12:22:00,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 12:22:00,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 12:22:00,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 12:22:00,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-18 12:22:00,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 12:22:00,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 12:22:00,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 12:22:00,364 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 12:22:00,493 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 12:22:00,494 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 12:22:00,810 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 12:22:00,976 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 12:22:00,977 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-18 12:22:00,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 12:22:00 BoogieIcfgContainer [2022-01-18 12:22:00,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 12:22:00,980 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 12:22:00,980 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 12:22:00,992 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 12:22:00,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 12:21:59" (1/3) ... [2022-01-18 12:22:00,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afcb138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 12:22:00, skipping insertion in model container [2022-01-18 12:22:00,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:22:00" (2/3) ... [2022-01-18 12:22:00,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afcb138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 12:22:00, skipping insertion in model container [2022-01-18 12:22:00,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 12:22:00" (3/3) ... [2022-01-18 12:22:00,994 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt.wvr.c [2022-01-18 12:22:01,001 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-18 12:22:01,001 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 12:22:01,002 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-18 12:22:01,002 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 12:22:01,070 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,071 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,071 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,071 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,071 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,072 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,072 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,072 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,072 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,072 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,072 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,072 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,072 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,073 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,073 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,073 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,073 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,073 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,073 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,073 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,073 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,074 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,075 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,075 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,075 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,075 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,075 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,075 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,075 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,075 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,076 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,076 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,076 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,077 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,077 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,077 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,077 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,077 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,078 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,078 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,078 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,078 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,078 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,078 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,079 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,079 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,079 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,079 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,079 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,079 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,080 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,080 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,080 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,080 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,080 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,080 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,081 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,081 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,081 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,081 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,081 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,081 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,081 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,081 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,081 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,082 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,082 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,083 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,083 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,091 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,091 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,091 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,091 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,092 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,092 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,092 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,094 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,094 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,094 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,095 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,095 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,095 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,096 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,097 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,097 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,098 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,100 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,100 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,100 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,100 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,100 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,100 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,101 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,101 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,101 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,101 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,101 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,101 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,101 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,101 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,102 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,102 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,102 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,102 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,102 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,102 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,102 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,102 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,102 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,103 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,103 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,103 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,103 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,103 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,103 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,104 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,104 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,104 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,104 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,104 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,105 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,105 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,105 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,105 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,106 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,106 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,106 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,106 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,106 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,106 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,106 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,107 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,109 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,109 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,110 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,110 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,110 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,110 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,110 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,110 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,111 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,111 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,111 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,111 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,111 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,111 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,112 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,112 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,112 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,113 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,113 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,113 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,113 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,113 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,113 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,113 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,113 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,114 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,114 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,114 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,114 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,115 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,115 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,115 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,115 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,115 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,115 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,115 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,116 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,116 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,116 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,116 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,116 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,116 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:22:01,119 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-18 12:22:01,155 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 12:22:01,160 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, 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 [2022-01-18 12:22:01,160 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-18 12:22:01,172 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 156 transitions, 336 flow [2022-01-18 12:22:01,413 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5072 states, 5071 states have (on average 3.8171958193650166) internal successors, (19357), 5071 states have internal predecessors, (19357), 0 states have call successors, (0), 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-01-18 12:22:01,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 5072 states, 5071 states have (on average 3.8171958193650166) internal successors, (19357), 5071 states have internal predecessors, (19357), 0 states have call successors, (0), 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-01-18 12:22:01,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 12:22:01,479 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:01,479 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] [2022-01-18 12:22:01,480 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:22:01,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:01,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1255483766, now seen corresponding path program 1 times [2022-01-18 12:22:01,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:01,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617113658] [2022-01-18 12:22:01,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:01,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:01,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:22:01,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:01,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617113658] [2022-01-18 12:22:01,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617113658] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 12:22:01,728 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 12:22:01,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 12:22:01,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567331548] [2022-01-18 12:22:01,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 12:22:01,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-18 12:22:01,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:22:01,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-18 12:22:01,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 12:22:01,790 INFO L87 Difference]: Start difference. First operand has 5072 states, 5071 states have (on average 3.8171958193650166) internal successors, (19357), 5071 states have internal predecessors, (19357), 0 states have call successors, (0), 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 52.5) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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-01-18 12:22:01,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:01,922 INFO L93 Difference]: Finished difference Result 5072 states and 17963 transitions. [2022-01-18 12:22:01,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-18 12:22:01,925 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-01-18 12:22:01,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:01,992 INFO L225 Difference]: With dead ends: 5072 [2022-01-18 12:22:01,992 INFO L226 Difference]: Without dead ends: 5068 [2022-01-18 12:22:01,994 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-01-18 12:22:01,997 INFO L933 BasicCegarLoop]: 125 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, 125 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-01-18 12:22:01,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 12:22:02,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5068 states. [2022-01-18 12:22:02,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5068 to 5068. [2022-01-18 12:22:02,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5068 states, 5067 states have (on average 3.544306295638445) internal successors, (17959), 5067 states have internal predecessors, (17959), 0 states have call successors, (0), 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-01-18 12:22:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5068 states to 5068 states and 17959 transitions. [2022-01-18 12:22:02,278 INFO L78 Accepts]: Start accepts. Automaton has 5068 states and 17959 transitions. Word has length 105 [2022-01-18 12:22:02,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:02,279 INFO L470 AbstractCegarLoop]: Abstraction has 5068 states and 17959 transitions. [2022-01-18 12:22:02,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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-01-18 12:22:02,280 INFO L276 IsEmpty]: Start isEmpty. Operand 5068 states and 17959 transitions. [2022-01-18 12:22:02,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-18 12:22:02,298 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:02,298 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] [2022-01-18 12:22:02,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 12:22:02,300 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:22:02,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:02,303 INFO L85 PathProgramCache]: Analyzing trace with hash 613749194, now seen corresponding path program 1 times [2022-01-18 12:22:02,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:02,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498585723] [2022-01-18 12:22:02,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:02,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:02,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:22:02,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:02,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498585723] [2022-01-18 12:22:02,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498585723] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 12:22:02,594 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 12:22:02,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 12:22:02,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551218024] [2022-01-18 12:22:02,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 12:22:02,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 12:22:02,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:22:02,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 12:22:02,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 12:22:02,599 INFO L87 Difference]: Start difference. First operand 5068 states and 17959 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 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-01-18 12:22:02,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:02,996 INFO L93 Difference]: Finished difference Result 9970 states and 35356 transitions. [2022-01-18 12:22:02,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-18 12:22:02,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-01-18 12:22:02,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:03,064 INFO L225 Difference]: With dead ends: 9970 [2022-01-18 12:22:03,065 INFO L226 Difference]: Without dead ends: 9820 [2022-01-18 12:22:03,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-18 12:22:03,066 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 174 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 12:22:03,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 477 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 12:22:03,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9820 states. [2022-01-18 12:22:03,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9820 to 5678. [2022-01-18 12:22:03,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5678 states, 5677 states have (on average 3.5317949621278846) internal successors, (20050), 5677 states have internal predecessors, (20050), 0 states have call successors, (0), 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-01-18 12:22:03,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5678 states to 5678 states and 20050 transitions. [2022-01-18 12:22:03,366 INFO L78 Accepts]: Start accepts. Automaton has 5678 states and 20050 transitions. Word has length 105 [2022-01-18 12:22:03,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:03,369 INFO L470 AbstractCegarLoop]: Abstraction has 5678 states and 20050 transitions. [2022-01-18 12:22:03,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 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-01-18 12:22:03,370 INFO L276 IsEmpty]: Start isEmpty. Operand 5678 states and 20050 transitions. [2022-01-18 12:22:03,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-01-18 12:22:03,394 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:03,395 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] [2022-01-18 12:22:03,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 12:22:03,395 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:22:03,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:03,396 INFO L85 PathProgramCache]: Analyzing trace with hash -2081314034, now seen corresponding path program 1 times [2022-01-18 12:22:03,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:03,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438193419] [2022-01-18 12:22:03,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:03,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:03,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:22:03,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:03,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438193419] [2022-01-18 12:22:03,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438193419] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 12:22:03,703 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 12:22:03,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-18 12:22:03,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224174123] [2022-01-18 12:22:03,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 12:22:03,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 12:22:03,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:22:03,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 12:22:03,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-18 12:22:03,706 INFO L87 Difference]: Start difference. First operand 5678 states and 20050 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 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-01-18 12:22:04,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:04,083 INFO L93 Difference]: Finished difference Result 8818 states and 30445 transitions. [2022-01-18 12:22:04,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-18 12:22:04,084 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2022-01-18 12:22:04,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:04,124 INFO L225 Difference]: With dead ends: 8818 [2022-01-18 12:22:04,125 INFO L226 Difference]: Without dead ends: 8728 [2022-01-18 12:22:04,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2022-01-18 12:22:04,131 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 554 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 12:22:04,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [554 Valid, 675 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 12:22:04,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8728 states. [2022-01-18 12:22:04,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8728 to 6938. [2022-01-18 12:22:04,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6938 states, 6937 states have (on average 3.5180913939743403) internal successors, (24405), 6937 states have internal predecessors, (24405), 0 states have call successors, (0), 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-01-18 12:22:04,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6938 states to 6938 states and 24405 transitions. [2022-01-18 12:22:04,384 INFO L78 Accepts]: Start accepts. Automaton has 6938 states and 24405 transitions. Word has length 111 [2022-01-18 12:22:04,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:04,384 INFO L470 AbstractCegarLoop]: Abstraction has 6938 states and 24405 transitions. [2022-01-18 12:22:04,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 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-01-18 12:22:04,385 INFO L276 IsEmpty]: Start isEmpty. Operand 6938 states and 24405 transitions. [2022-01-18 12:22:04,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-01-18 12:22:04,406 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:04,406 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] [2022-01-18 12:22:04,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 12:22:04,407 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:22:04,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:04,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1189826400, now seen corresponding path program 1 times [2022-01-18 12:22:04,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:04,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010708335] [2022-01-18 12:22:04,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:04,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:04,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:22:04,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:04,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010708335] [2022-01-18 12:22:04,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010708335] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 12:22:04,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 12:22:04,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-18 12:22:04,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410573041] [2022-01-18 12:22:04,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 12:22:04,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 12:22:04,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:22:04,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 12:22:04,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-18 12:22:04,684 INFO L87 Difference]: Start difference. First operand 6938 states and 24405 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 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-01-18 12:22:05,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:05,174 INFO L93 Difference]: Finished difference Result 7558 states and 25776 transitions. [2022-01-18 12:22:05,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-18 12:22:05,174 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2022-01-18 12:22:05,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:05,205 INFO L225 Difference]: With dead ends: 7558 [2022-01-18 12:22:05,206 INFO L226 Difference]: Without dead ends: 7294 [2022-01-18 12:22:05,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2022-01-18 12:22:05,207 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 564 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 12:22:05,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [564 Valid, 635 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 12:22:05,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7294 states. [2022-01-18 12:22:05,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7294 to 6848. [2022-01-18 12:22:05,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6848 states, 6847 states have (on average 3.465897473345991) internal successors, (23731), 6847 states have internal predecessors, (23731), 0 states have call successors, (0), 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-01-18 12:22:05,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6848 states to 6848 states and 23731 transitions. [2022-01-18 12:22:05,485 INFO L78 Accepts]: Start accepts. Automaton has 6848 states and 23731 transitions. Word has length 111 [2022-01-18 12:22:05,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:05,485 INFO L470 AbstractCegarLoop]: Abstraction has 6848 states and 23731 transitions. [2022-01-18 12:22:05,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 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-01-18 12:22:05,486 INFO L276 IsEmpty]: Start isEmpty. Operand 6848 states and 23731 transitions. [2022-01-18 12:22:05,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-01-18 12:22:05,508 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:05,508 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] [2022-01-18 12:22:05,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-18 12:22:05,509 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:22:05,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:05,509 INFO L85 PathProgramCache]: Analyzing trace with hash -805575258, now seen corresponding path program 1 times [2022-01-18 12:22:05,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:05,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116414897] [2022-01-18 12:22:05,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:05,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:05,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:22:05,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:05,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116414897] [2022-01-18 12:22:05,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116414897] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 12:22:05,571 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 12:22:05,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 12:22:05,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583222136] [2022-01-18 12:22:05,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 12:22:05,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 12:22:05,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:22:05,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 12:22:05,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-18 12:22:05,573 INFO L87 Difference]: Start difference. First operand 6848 states and 23731 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 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-01-18 12:22:05,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:05,689 INFO L93 Difference]: Finished difference Result 5971 states and 20798 transitions. [2022-01-18 12:22:05,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-18 12:22:05,689 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2022-01-18 12:22:05,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:05,712 INFO L225 Difference]: With dead ends: 5971 [2022-01-18 12:22:05,712 INFO L226 Difference]: Without dead ends: 5684 [2022-01-18 12:22:05,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-01-18 12:22:05,717 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 379 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 12:22:05,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 393 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 12:22:05,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5684 states. [2022-01-18 12:22:05,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5684 to 5679. [2022-01-18 12:22:05,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5679 states, 5678 states have (on average 3.5313490665727367) internal successors, (20051), 5678 states have internal predecessors, (20051), 0 states have call successors, (0), 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-01-18 12:22:05,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5679 states to 5679 states and 20051 transitions. [2022-01-18 12:22:05,986 INFO L78 Accepts]: Start accepts. Automaton has 5679 states and 20051 transitions. Word has length 111 [2022-01-18 12:22:05,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:05,986 INFO L470 AbstractCegarLoop]: Abstraction has 5679 states and 20051 transitions. [2022-01-18 12:22:05,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 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-01-18 12:22:05,987 INFO L276 IsEmpty]: Start isEmpty. Operand 5679 states and 20051 transitions. [2022-01-18 12:22:06,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-18 12:22:06,001 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:06,001 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] [2022-01-18 12:22:06,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 12:22:06,002 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:22:06,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:06,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1704257340, now seen corresponding path program 1 times [2022-01-18 12:22:06,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:06,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900401253] [2022-01-18 12:22:06,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:06,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:06,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:06,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:06,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900401253] [2022-01-18 12:22:06,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900401253] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:22:06,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830129873] [2022-01-18 12:22:06,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:06,100 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:22:06,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:22:06,103 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-01-18 12:22:06,129 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-01-18 12:22:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:06,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-18 12:22:06,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:22:06,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:06,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:22:06,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:06,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830129873] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-18 12:22:06,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-18 12:22:06,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-18 12:22:06,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537179887] [2022-01-18 12:22:06,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 12:22:06,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 12:22:06,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:22:06,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 12:22:06,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-18 12:22:06,843 INFO L87 Difference]: Start difference. First operand 5679 states and 20051 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 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-01-18 12:22:06,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:06,951 INFO L93 Difference]: Finished difference Result 5775 states and 20516 transitions. [2022-01-18 12:22:06,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 12:22:06,952 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2022-01-18 12:22:06,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:06,974 INFO L225 Difference]: With dead ends: 5775 [2022-01-18 12:22:06,974 INFO L226 Difference]: Without dead ends: 5775 [2022-01-18 12:22:06,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 228 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-01-18 12:22:06,976 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 248 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 12:22:06,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 335 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 12:22:06,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5775 states. [2022-01-18 12:22:07,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5775 to 5535. [2022-01-18 12:22:07,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5535 states, 5534 states have (on average 3.5511384170581857) internal successors, (19652), 5534 states have internal predecessors, (19652), 0 states have call successors, (0), 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-01-18 12:22:07,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5535 states to 5535 states and 19652 transitions. [2022-01-18 12:22:07,113 INFO L78 Accepts]: Start accepts. Automaton has 5535 states and 19652 transitions. Word has length 118 [2022-01-18 12:22:07,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:07,114 INFO L470 AbstractCegarLoop]: Abstraction has 5535 states and 19652 transitions. [2022-01-18 12:22:07,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 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-01-18 12:22:07,114 INFO L276 IsEmpty]: Start isEmpty. Operand 5535 states and 19652 transitions. [2022-01-18 12:22:07,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-18 12:22:07,128 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:07,129 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] [2022-01-18 12:22:07,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-18 12:22:07,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-18 12:22:07,352 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:22:07,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:07,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1314971180, now seen corresponding path program 1 times [2022-01-18 12:22:07,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:07,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796801086] [2022-01-18 12:22:07,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:07,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:07,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:07,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:07,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796801086] [2022-01-18 12:22:07,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796801086] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:22:07,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319331423] [2022-01-18 12:22:07,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:07,472 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:22:07,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:22:07,473 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-01-18 12:22:07,475 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-01-18 12:22:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:07,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-18 12:22:07,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:22:07,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:07,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:22:08,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:08,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319331423] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-18 12:22:08,186 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-18 12:22:08,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-01-18 12:22:08,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284053673] [2022-01-18 12:22:08,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 12:22:08,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 12:22:08,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:22:08,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 12:22:08,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-01-18 12:22:08,187 INFO L87 Difference]: Start difference. First operand 5535 states and 19652 transitions. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 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-01-18 12:22:08,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:08,444 INFO L93 Difference]: Finished difference Result 7577 states and 27120 transitions. [2022-01-18 12:22:08,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-18 12:22:08,444 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2022-01-18 12:22:08,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:08,471 INFO L225 Difference]: With dead ends: 7577 [2022-01-18 12:22:08,471 INFO L226 Difference]: Without dead ends: 7577 [2022-01-18 12:22:08,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 226 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2022-01-18 12:22:08,473 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 373 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 12:22:08,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 576 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 12:22:08,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7577 states. [2022-01-18 12:22:08,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7577 to 5864. [2022-01-18 12:22:08,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5864 states, 5863 states have (on average 3.551594746716698) internal successors, (20823), 5863 states have internal predecessors, (20823), 0 states have call successors, (0), 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-01-18 12:22:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5864 states to 5864 states and 20823 transitions. [2022-01-18 12:22:08,658 INFO L78 Accepts]: Start accepts. Automaton has 5864 states and 20823 transitions. Word has length 118 [2022-01-18 12:22:08,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:08,659 INFO L470 AbstractCegarLoop]: Abstraction has 5864 states and 20823 transitions. [2022-01-18 12:22:08,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 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-01-18 12:22:08,659 INFO L276 IsEmpty]: Start isEmpty. Operand 5864 states and 20823 transitions. [2022-01-18 12:22:08,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-18 12:22:08,707 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:08,708 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] [2022-01-18 12:22:08,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-18 12:22:08,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-01-18 12:22:08,908 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:22:08,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:08,909 INFO L85 PathProgramCache]: Analyzing trace with hash 267659860, now seen corresponding path program 2 times [2022-01-18 12:22:08,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:08,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640017384] [2022-01-18 12:22:08,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:08,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:09,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:09,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:09,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640017384] [2022-01-18 12:22:09,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640017384] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:22:09,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727732656] [2022-01-18 12:22:09,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 12:22:09,005 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:22:09,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:22:09,006 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-01-18 12:22:09,011 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-01-18 12:22:09,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 12:22:09,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:22:09,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-18 12:22:09,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:22:09,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:09,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:22:09,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:09,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727732656] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:22:09,515 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:22:09,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 17 [2022-01-18 12:22:09,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835623632] [2022-01-18 12:22:09,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:22:09,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-18 12:22:09,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:22:09,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-18 12:22:09,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-01-18 12:22:09,518 INFO L87 Difference]: Start difference. First operand 5864 states and 20823 transitions. Second operand has 17 states, 17 states have (on average 10.882352941176471) internal successors, (185), 17 states have internal predecessors, (185), 0 states have call successors, (0), 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-01-18 12:22:10,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:10,647 INFO L93 Difference]: Finished difference Result 26682 states and 97534 transitions. [2022-01-18 12:22:10,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-18 12:22:10,647 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 10.882352941176471) internal successors, (185), 17 states have internal predecessors, (185), 0 states have call successors, (0), 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 118 [2022-01-18 12:22:10,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:10,841 INFO L225 Difference]: With dead ends: 26682 [2022-01-18 12:22:10,842 INFO L226 Difference]: Without dead ends: 26682 [2022-01-18 12:22:10,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 228 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=570, Invalid=1686, Unknown=0, NotChecked=0, Total=2256 [2022-01-18 12:22:10,843 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 1077 mSDsluCounter, 1538 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-18 12:22:10,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1077 Valid, 1713 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-18 12:22:10,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26682 states. [2022-01-18 12:22:11,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26682 to 5911. [2022-01-18 12:22:11,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5911 states, 5910 states have (on average 3.5686971235194584) internal successors, (21091), 5910 states have internal predecessors, (21091), 0 states have call successors, (0), 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-01-18 12:22:11,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5911 states to 5911 states and 21091 transitions. [2022-01-18 12:22:11,239 INFO L78 Accepts]: Start accepts. Automaton has 5911 states and 21091 transitions. Word has length 118 [2022-01-18 12:22:11,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:11,239 INFO L470 AbstractCegarLoop]: Abstraction has 5911 states and 21091 transitions. [2022-01-18 12:22:11,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.882352941176471) internal successors, (185), 17 states have internal predecessors, (185), 0 states have call successors, (0), 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-01-18 12:22:11,240 INFO L276 IsEmpty]: Start isEmpty. Operand 5911 states and 21091 transitions. [2022-01-18 12:22:11,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-18 12:22:11,255 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:11,255 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] [2022-01-18 12:22:11,287 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-01-18 12:22:11,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:22:11,476 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:22:11,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:11,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1570091000, now seen corresponding path program 3 times [2022-01-18 12:22:11,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:11,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890166930] [2022-01-18 12:22:11,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:11,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:11,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:11,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:11,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890166930] [2022-01-18 12:22:11,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890166930] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:22:11,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138880558] [2022-01-18 12:22:11,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 12:22:11,571 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:22:11,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:22:11,572 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-01-18 12:22:11,597 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-01-18 12:22:11,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 12:22:11,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:22:11,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-18 12:22:11,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:22:11,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:11,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:22:12,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:12,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138880558] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:22:12,077 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:22:12,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2022-01-18 12:22:12,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129255320] [2022-01-18 12:22:12,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:22:12,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-18 12:22:12,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:22:12,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-18 12:22:12,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-01-18 12:22:12,079 INFO L87 Difference]: Start difference. First operand 5911 states and 21091 transitions. Second operand has 16 states, 16 states have (on average 11.375) internal successors, (182), 16 states have internal predecessors, (182), 0 states have call successors, (0), 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-01-18 12:22:12,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:12,989 INFO L93 Difference]: Finished difference Result 18477 states and 67462 transitions. [2022-01-18 12:22:12,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-18 12:22:12,989 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.375) internal successors, (182), 16 states have internal predecessors, (182), 0 states have call successors, (0), 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 118 [2022-01-18 12:22:12,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:13,058 INFO L225 Difference]: With dead ends: 18477 [2022-01-18 12:22:13,058 INFO L226 Difference]: Without dead ends: 18477 [2022-01-18 12:22:13,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=362, Invalid=970, Unknown=0, NotChecked=0, Total=1332 [2022-01-18 12:22:13,061 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 752 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-18 12:22:13,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [752 Valid, 1606 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-18 12:22:13,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18477 states. [2022-01-18 12:22:13,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18477 to 6055. [2022-01-18 12:22:13,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6055 states, 6054 states have (on average 3.5632639577139082) internal successors, (21572), 6054 states have internal predecessors, (21572), 0 states have call successors, (0), 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-01-18 12:22:13,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6055 states to 6055 states and 21572 transitions. [2022-01-18 12:22:13,354 INFO L78 Accepts]: Start accepts. Automaton has 6055 states and 21572 transitions. Word has length 118 [2022-01-18 12:22:13,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:13,355 INFO L470 AbstractCegarLoop]: Abstraction has 6055 states and 21572 transitions. [2022-01-18 12:22:13,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.375) internal successors, (182), 16 states have internal predecessors, (182), 0 states have call successors, (0), 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-01-18 12:22:13,355 INFO L276 IsEmpty]: Start isEmpty. Operand 6055 states and 21572 transitions. [2022-01-18 12:22:13,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-18 12:22:13,372 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:13,372 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] [2022-01-18 12:22:13,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-18 12:22:13,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:22:13,587 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:22:13,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:13,588 INFO L85 PathProgramCache]: Analyzing trace with hash -2139413420, now seen corresponding path program 4 times [2022-01-18 12:22:13,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:13,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160845870] [2022-01-18 12:22:13,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:13,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:13,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:13,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:13,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160845870] [2022-01-18 12:22:13,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160845870] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:22:13,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400279115] [2022-01-18 12:22:13,695 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 12:22:13,695 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:22:13,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:22:13,696 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-01-18 12:22:13,697 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-01-18 12:22:13,785 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 12:22:13,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:22:13,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-18 12:22:13,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:22:14,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:14,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:22:14,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:14,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400279115] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-18 12:22:14,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-18 12:22:14,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 20 [2022-01-18 12:22:14,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700282561] [2022-01-18 12:22:14,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 12:22:14,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 12:22:14,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:22:14,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 12:22:14,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-01-18 12:22:14,429 INFO L87 Difference]: Start difference. First operand 6055 states and 21572 transitions. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 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-01-18 12:22:14,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:14,734 INFO L93 Difference]: Finished difference Result 12871 states and 46133 transitions. [2022-01-18 12:22:14,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-18 12:22:14,739 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2022-01-18 12:22:14,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:14,771 INFO L225 Difference]: With dead ends: 12871 [2022-01-18 12:22:14,771 INFO L226 Difference]: Without dead ends: 12871 [2022-01-18 12:22:14,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 224 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2022-01-18 12:22:14,771 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 391 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 12:22:14,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [391 Valid, 734 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 12:22:14,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12871 states. [2022-01-18 12:22:14,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12871 to 6215. [2022-01-18 12:22:14,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6215 states, 6214 states have (on average 3.5926939169616996) internal successors, (22325), 6214 states have internal predecessors, (22325), 0 states have call successors, (0), 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-01-18 12:22:14,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 22325 transitions. [2022-01-18 12:22:14,971 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 22325 transitions. Word has length 118 [2022-01-18 12:22:14,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:14,971 INFO L470 AbstractCegarLoop]: Abstraction has 6215 states and 22325 transitions. [2022-01-18 12:22:14,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 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-01-18 12:22:14,972 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 22325 transitions. [2022-01-18 12:22:14,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-18 12:22:14,989 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:14,990 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] [2022-01-18 12:22:15,008 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-01-18 12:22:15,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-18 12:22:15,199 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:22:15,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:15,200 INFO L85 PathProgramCache]: Analyzing trace with hash -836982280, now seen corresponding path program 5 times [2022-01-18 12:22:15,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:15,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697936638] [2022-01-18 12:22:15,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:15,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:15,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:15,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:15,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697936638] [2022-01-18 12:22:15,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697936638] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:22:15,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110865163] [2022-01-18 12:22:15,299 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 12:22:15,299 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:22:15,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:22:15,300 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-01-18 12:22:15,301 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-01-18 12:22:15,394 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 12:22:15,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:22:15,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-18 12:22:15,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:22:15,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:15,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:22:15,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:15,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110865163] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:22:15,778 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:22:15,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2022-01-18 12:22:15,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938875708] [2022-01-18 12:22:15,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:22:15,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-18 12:22:15,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:22:15,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-18 12:22:15,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-01-18 12:22:15,781 INFO L87 Difference]: Start difference. First operand 6215 states and 22325 transitions. Second operand has 16 states, 16 states have (on average 11.25) internal successors, (180), 16 states have internal predecessors, (180), 0 states have call successors, (0), 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-01-18 12:22:16,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:16,819 INFO L93 Difference]: Finished difference Result 22956 states and 82999 transitions. [2022-01-18 12:22:16,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-18 12:22:16,819 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.25) internal successors, (180), 16 states have internal predecessors, (180), 0 states have call successors, (0), 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 118 [2022-01-18 12:22:16,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:16,883 INFO L225 Difference]: With dead ends: 22956 [2022-01-18 12:22:16,883 INFO L226 Difference]: Without dead ends: 22956 [2022-01-18 12:22:16,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=1076, Unknown=0, NotChecked=0, Total=1482 [2022-01-18 12:22:16,885 INFO L933 BasicCegarLoop]: 294 mSDtfsCounter, 722 mSDsluCounter, 2522 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 2690 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-18 12:22:16,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [722 Valid, 2690 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-18 12:22:16,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22956 states. [2022-01-18 12:22:17,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22956 to 6168. [2022-01-18 12:22:17,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6168 states, 6167 states have (on average 3.5766174801362087) internal successors, (22057), 6167 states have internal predecessors, (22057), 0 states have call successors, (0), 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-01-18 12:22:17,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6168 states to 6168 states and 22057 transitions. [2022-01-18 12:22:17,147 INFO L78 Accepts]: Start accepts. Automaton has 6168 states and 22057 transitions. Word has length 118 [2022-01-18 12:22:17,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:17,148 INFO L470 AbstractCegarLoop]: Abstraction has 6168 states and 22057 transitions. [2022-01-18 12:22:17,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.25) internal successors, (180), 16 states have internal predecessors, (180), 0 states have call successors, (0), 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-01-18 12:22:17,148 INFO L276 IsEmpty]: Start isEmpty. Operand 6168 states and 22057 transitions. [2022-01-18 12:22:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-18 12:22:17,159 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:17,159 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] [2022-01-18 12:22:17,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-18 12:22:17,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:22:17,382 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:22:17,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:17,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1449163496, now seen corresponding path program 6 times [2022-01-18 12:22:17,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:17,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430472294] [2022-01-18 12:22:17,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:17,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:17,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:17,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430472294] [2022-01-18 12:22:17,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430472294] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:22:17,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664815278] [2022-01-18 12:22:17,474 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 12:22:17,474 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:22:17,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:22:17,475 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-01-18 12:22:17,476 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-01-18 12:22:17,571 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-01-18 12:22:17,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:22:17,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-18 12:22:17,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:22:17,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:17,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:22:17,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:17,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664815278] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:22:17,973 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:22:17,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 15 [2022-01-18 12:22:17,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503561394] [2022-01-18 12:22:17,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:22:17,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-18 12:22:17,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:22:17,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-18 12:22:17,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-01-18 12:22:17,975 INFO L87 Difference]: Start difference. First operand 6168 states and 22057 transitions. Second operand has 15 states, 15 states have (on average 11.933333333333334) internal successors, (179), 15 states have internal predecessors, (179), 0 states have call successors, (0), 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-01-18 12:22:18,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:18,615 INFO L93 Difference]: Finished difference Result 14859 states and 53179 transitions. [2022-01-18 12:22:18,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-18 12:22:18,616 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.933333333333334) internal successors, (179), 15 states have internal predecessors, (179), 0 states have call successors, (0), 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 118 [2022-01-18 12:22:18,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:18,655 INFO L225 Difference]: With dead ends: 14859 [2022-01-18 12:22:18,655 INFO L226 Difference]: Without dead ends: 14859 [2022-01-18 12:22:18,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 230 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=262, Invalid=730, Unknown=0, NotChecked=0, Total=992 [2022-01-18 12:22:18,656 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 535 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-18 12:22:18,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [535 Valid, 1835 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-18 12:22:18,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14859 states. [2022-01-18 12:22:18,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14859 to 6510. [2022-01-18 12:22:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6510 states, 6509 states have (on average 3.5437087110155168) internal successors, (23066), 6509 states have internal predecessors, (23066), 0 states have call successors, (0), 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-01-18 12:22:18,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6510 states to 6510 states and 23066 transitions. [2022-01-18 12:22:18,853 INFO L78 Accepts]: Start accepts. Automaton has 6510 states and 23066 transitions. Word has length 118 [2022-01-18 12:22:18,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:18,853 INFO L470 AbstractCegarLoop]: Abstraction has 6510 states and 23066 transitions. [2022-01-18 12:22:18,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.933333333333334) internal successors, (179), 15 states have internal predecessors, (179), 0 states have call successors, (0), 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-01-18 12:22:18,854 INFO L276 IsEmpty]: Start isEmpty. Operand 6510 states and 23066 transitions. [2022-01-18 12:22:18,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:22:18,868 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:18,868 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] [2022-01-18 12:22:18,890 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-01-18 12:22:19,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:22:19,091 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:22:19,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:19,091 INFO L85 PathProgramCache]: Analyzing trace with hash 372116376, now seen corresponding path program 1 times [2022-01-18 12:22:19,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:19,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188633924] [2022-01-18 12:22:19,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:19,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:19,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:19,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:19,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188633924] [2022-01-18 12:22:19,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188633924] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:22:19,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296569037] [2022-01-18 12:22:19,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:19,606 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:22:19,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:22:19,612 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-01-18 12:22:19,613 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-01-18 12:22:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:19,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 71 conjunts are in the unsatisfiable core [2022-01-18 12:22:19,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:22:19,791 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-01-18 12:22:19,840 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-18 12:22:19,840 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-01-18 12:22:20,268 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 12:22:20,269 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-01-18 12:22:20,448 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-01-18 12:22:20,779 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-01-18 12:22:21,051 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 12:22:21,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:22:21,123 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 12:22:21,225 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-01-18 12:22:21,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:22:21,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:22:21,429 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_333 (Array Int Int))) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base) c_~A~0.offset) (* (- 1) c_~res1~0)) 0)) is different from false [2022-01-18 12:22:21,470 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base) c_~A~0.offset) c_~res2~0 (* (- 1) c_~res1~0)) 0)) is different from false [2022-01-18 12:22:21,523 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base) c_~A~0.offset) (* (- 1) |c_thread1Thread1of1ForFork0_~tmp~0#1|) c_~res2~0) 0)) is different from false [2022-01-18 12:22:21,535 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base) c_~A~0.offset) c_~res2~0 (* (- 1) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (* (- 1) c_~res1~0)) 0)) is different from false [2022-01-18 12:22:21,561 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= 0 (+ (* (- 1) (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base) c_~A~0.offset) c_~res2~0 (* (- 1) c_~res1~0)))) is different from false [2022-01-18 12:22:21,576 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_331 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_331))) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base) c_~A~0.offset) (* (- 1) (select (select .cse0 c_~A~0.base) c_~A~0.offset)) (* (- 1) c_~res1~0))) 0)) is different from false [2022-01-18 12:22:21,637 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_331 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_331))) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res2~0 (* (- 1) (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (* (- 1) c_~res1~0))) 0)) is different from false [2022-01-18 12:22:21,650 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_331 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_331))) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (* (- 1) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (* (- 1) c_~res1~0))) 0)) is different from false [2022-01-18 12:22:21,657 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_331 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_331))) (+ (* (- 1) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res2~0 (* (- 1) c_~res1~0))))) is different from false [2022-01-18 12:22:21,701 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:22:21,702 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 55 treesize of output 44 [2022-01-18 12:22:21,708 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 790 treesize of output 726 [2022-01-18 12:22:21,716 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 726 treesize of output 710 [2022-01-18 12:22:21,726 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 710 treesize of output 678 [2022-01-18 12:22:21,733 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 678 treesize of output 646 [2022-01-18 12:22:25,134 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 12:22:25,136 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-01-18 12:22:25,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-18 12:22:25,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296569037] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:22:25,158 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:22:25,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24, 22] total 54 [2022-01-18 12:22:25,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557973338] [2022-01-18 12:22:25,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:22:25,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-01-18 12:22:25,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:22:25,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-01-18 12:22:25,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1797, Unknown=9, NotChecked=846, Total=2862 [2022-01-18 12:22:25,161 INFO L87 Difference]: Start difference. First operand 6510 states and 23066 transitions. Second operand has 54 states, 54 states have (on average 5.537037037037037) internal successors, (299), 54 states have internal predecessors, (299), 0 states have call successors, (0), 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-01-18 12:22:28,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:28,045 INFO L93 Difference]: Finished difference Result 18736 states and 66973 transitions. [2022-01-18 12:22:28,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-18 12:22:28,046 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.537037037037037) internal successors, (299), 54 states have internal predecessors, (299), 0 states have call successors, (0), 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 124 [2022-01-18 12:22:28,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:28,095 INFO L225 Difference]: With dead ends: 18736 [2022-01-18 12:22:28,095 INFO L226 Difference]: Without dead ends: 18586 [2022-01-18 12:22:28,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 217 SyntacticMatches, 11 SemanticMatches, 81 ConstructedPredicates, 9 IntricatePredicates, 3 DeprecatedPredicates, 1559 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=668, Invalid=4761, Unknown=9, NotChecked=1368, Total=6806 [2022-01-18 12:22:28,097 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 1626 mSDsluCounter, 5401 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1626 SdHoareTripleChecker+Valid, 5230 SdHoareTripleChecker+Invalid, 6137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4004 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-18 12:22:28,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1626 Valid, 5230 Invalid, 6137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2090 Invalid, 0 Unknown, 4004 Unchecked, 1.0s Time] [2022-01-18 12:22:28,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18586 states. [2022-01-18 12:22:28,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18586 to 9408. [2022-01-18 12:22:28,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9408 states, 9407 states have (on average 3.5748910385882855) internal successors, (33629), 9407 states have internal predecessors, (33629), 0 states have call successors, (0), 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-01-18 12:22:28,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9408 states to 9408 states and 33629 transitions. [2022-01-18 12:22:28,367 INFO L78 Accepts]: Start accepts. Automaton has 9408 states and 33629 transitions. Word has length 124 [2022-01-18 12:22:28,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:28,367 INFO L470 AbstractCegarLoop]: Abstraction has 9408 states and 33629 transitions. [2022-01-18 12:22:28,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.537037037037037) internal successors, (299), 54 states have internal predecessors, (299), 0 states have call successors, (0), 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-01-18 12:22:28,368 INFO L276 IsEmpty]: Start isEmpty. Operand 9408 states and 33629 transitions. [2022-01-18 12:22:28,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:22:28,388 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:28,388 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] [2022-01-18 12:22:28,408 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-01-18 12:22:28,599 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,SelfDestructingSolverStorable12 [2022-01-18 12:22:28,599 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:22:28,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:28,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1263604010, now seen corresponding path program 1 times [2022-01-18 12:22:28,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:28,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346184237] [2022-01-18 12:22:28,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:28,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:29,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:22:29,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:29,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346184237] [2022-01-18 12:22:29,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346184237] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:22:29,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800786491] [2022-01-18 12:22:29,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:29,501 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:22:29,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:22:29,504 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:22:29,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-18 12:22:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:29,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 85 conjunts are in the unsatisfiable core [2022-01-18 12:22:29,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:22:29,680 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-01-18 12:22:29,728 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-18 12:22:29,729 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-01-18 12:22:30,334 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 12:22:30,334 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-01-18 12:22:30,640 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-01-18 12:22:31,339 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-01-18 12:22:31,766 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 12:22:31,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:22:31,922 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 12:22:32,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 12:22:32,144 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:22:32,144 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 17 treesize of output 10 [2022-01-18 12:22:32,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:22:32,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:22:34,084 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:22:34,085 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 55 treesize of output 44 [2022-01-18 12:22:34,094 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:22:34,095 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 830 treesize of output 746 [2022-01-18 12:22:34,105 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 734 treesize of output 638 [2022-01-18 12:22:34,112 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 638 treesize of output 590 [2022-01-18 12:22:34,126 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:22:34,126 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 590 treesize of output 546 [2022-01-18 12:22:36,272 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 12:22:36,274 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-01-18 12:22:36,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:22:36,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800786491] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:22:36,296 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:22:36,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 32] total 83 [2022-01-18 12:22:36,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112512871] [2022-01-18 12:22:36,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:22:36,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-01-18 12:22:36,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:22:36,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-01-18 12:22:36,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=6217, Unknown=74, NotChecked=0, Total=6806 [2022-01-18 12:22:36,299 INFO L87 Difference]: Start difference. First operand 9408 states and 33629 transitions. Second operand has 83 states, 83 states have (on average 3.63855421686747) internal successors, (302), 83 states have internal predecessors, (302), 0 states have call successors, (0), 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-01-18 12:22:43,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:43,384 INFO L93 Difference]: Finished difference Result 36669 states and 132152 transitions. [2022-01-18 12:22:43,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-01-18 12:22:43,385 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 3.63855421686747) internal successors, (302), 83 states have internal predecessors, (302), 0 states have call successors, (0), 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 124 [2022-01-18 12:22:43,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:43,508 INFO L225 Difference]: With dead ends: 36669 [2022-01-18 12:22:43,508 INFO L226 Difference]: Without dead ends: 36369 [2022-01-18 12:22:43,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5892 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=2233, Invalid=17715, Unknown=74, NotChecked=0, Total=20022 [2022-01-18 12:22:43,513 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 3268 mSDsluCounter, 10626 mSDsCounter, 0 mSdLazyCounter, 4953 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3268 SdHoareTripleChecker+Valid, 9915 SdHoareTripleChecker+Invalid, 8507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 4953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3452 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-18 12:22:43,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3268 Valid, 9915 Invalid, 8507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 4953 Invalid, 0 Unknown, 3452 Unchecked, 2.1s Time] [2022-01-18 12:22:43,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36369 states. [2022-01-18 12:22:43,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36369 to 11810. [2022-01-18 12:22:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11810 states, 11809 states have (on average 3.587009907697519) internal successors, (42359), 11809 states have internal predecessors, (42359), 0 states have call successors, (0), 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-01-18 12:22:43,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11810 states to 11810 states and 42359 transitions. [2022-01-18 12:22:43,893 INFO L78 Accepts]: Start accepts. Automaton has 11810 states and 42359 transitions. Word has length 124 [2022-01-18 12:22:43,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:43,894 INFO L470 AbstractCegarLoop]: Abstraction has 11810 states and 42359 transitions. [2022-01-18 12:22:43,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 3.63855421686747) internal successors, (302), 83 states have internal predecessors, (302), 0 states have call successors, (0), 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-01-18 12:22:43,894 INFO L276 IsEmpty]: Start isEmpty. Operand 11810 states and 42359 transitions. [2022-01-18 12:22:43,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:22:43,913 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:43,914 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] [2022-01-18 12:22:43,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-18 12:22:44,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-18 12:22:44,123 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:22:44,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:44,124 INFO L85 PathProgramCache]: Analyzing trace with hash 541534492, now seen corresponding path program 2 times [2022-01-18 12:22:44,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:44,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157377291] [2022-01-18 12:22:44,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:44,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:44,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:22:44,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:44,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157377291] [2022-01-18 12:22:44,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157377291] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:22:44,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887071445] [2022-01-18 12:22:44,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 12:22:44,687 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:22:44,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:22:44,689 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:22:44,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-18 12:22:44,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 12:22:44,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:22:44,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 64 conjunts are in the unsatisfiable core [2022-01-18 12:22:44,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:22:45,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:22:45,576 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 18 treesize of output 20 [2022-01-18 12:22:45,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:22:45,666 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 18 treesize of output 20 [2022-01-18 12:22:45,791 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-01-18 12:22:45,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:45,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:22:46,044 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int))) (= 0 (+ (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_406) c_~A~0.base) c_~A~0.offset)) |c_thread1Thread1of1ForFork0_~tmp~0#1| (* (- 1) c_~res2~0)))) is different from false [2022-01-18 12:22:46,066 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (= (+ (* (- 1) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_406) c_~A~0.base) c_~A~0.offset)) |c_thread1Thread1of1ForFork0_~tmp~0#1| (* (- 1) c_~res2~0)) 0)) is different from false [2022-01-18 12:22:46,092 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:22:46,093 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 116 treesize of output 92 [2022-01-18 12:22:46,095 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 80 treesize of output 76 [2022-01-18 12:22:46,101 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 38 treesize of output 36 [2022-01-18 12:22:46,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:46,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887071445] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:22:46,675 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:22:46,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 20] total 51 [2022-01-18 12:22:46,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323328758] [2022-01-18 12:22:46,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:22:46,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-01-18 12:22:46,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:22:46,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-01-18 12:22:46,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=2127, Unknown=2, NotChecked=190, Total=2550 [2022-01-18 12:22:46,677 INFO L87 Difference]: Start difference. First operand 11810 states and 42359 transitions. Second operand has 51 states, 51 states have (on average 5.666666666666667) internal successors, (289), 51 states have internal predecessors, (289), 0 states have call successors, (0), 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-01-18 12:22:48,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:48,508 INFO L93 Difference]: Finished difference Result 18584 states and 66824 transitions. [2022-01-18 12:22:48,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-18 12:22:48,508 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 5.666666666666667) internal successors, (289), 51 states have internal predecessors, (289), 0 states have call successors, (0), 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 124 [2022-01-18 12:22:48,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:48,554 INFO L225 Difference]: With dead ends: 18584 [2022-01-18 12:22:48,554 INFO L226 Difference]: Without dead ends: 18434 [2022-01-18 12:22:48,556 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 224 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1308 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=628, Invalid=4070, Unknown=2, NotChecked=270, Total=4970 [2022-01-18 12:22:48,559 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 1208 mSDsluCounter, 3922 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 3874 SdHoareTripleChecker+Invalid, 2072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 663 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-18 12:22:48,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1208 Valid, 3874 Invalid, 2072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1389 Invalid, 0 Unknown, 663 Unchecked, 0.5s Time] [2022-01-18 12:22:48,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18434 states. [2022-01-18 12:22:48,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18434 to 12232. [2022-01-18 12:22:48,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12232 states, 12231 states have (on average 3.5917749979560134) internal successors, (43931), 12231 states have internal predecessors, (43931), 0 states have call successors, (0), 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-01-18 12:22:48,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12232 states to 12232 states and 43931 transitions. [2022-01-18 12:22:48,911 INFO L78 Accepts]: Start accepts. Automaton has 12232 states and 43931 transitions. Word has length 124 [2022-01-18 12:22:48,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:48,911 INFO L470 AbstractCegarLoop]: Abstraction has 12232 states and 43931 transitions. [2022-01-18 12:22:48,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 5.666666666666667) internal successors, (289), 51 states have internal predecessors, (289), 0 states have call successors, (0), 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-01-18 12:22:48,912 INFO L276 IsEmpty]: Start isEmpty. Operand 12232 states and 43931 transitions. [2022-01-18 12:22:48,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:22:48,936 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:48,936 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] [2022-01-18 12:22:48,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-18 12:22:49,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-18 12:22:49,136 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:22:49,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:49,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1105715552, now seen corresponding path program 3 times [2022-01-18 12:22:49,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:49,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742009797] [2022-01-18 12:22:49,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:49,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:49,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:49,508 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:49,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742009797] [2022-01-18 12:22:49,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742009797] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:22:49,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905005935] [2022-01-18 12:22:49,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 12:22:49,508 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:22:49,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:22:49,509 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:22:49,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-18 12:22:49,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 12:22:49,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:22:49,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 64 conjunts are in the unsatisfiable core [2022-01-18 12:22:49,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:22:50,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:22:50,279 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 18 treesize of output 20 [2022-01-18 12:22:50,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:22:50,353 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 18 treesize of output 20 [2022-01-18 12:22:50,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-01-18 12:22:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:50,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:22:50,637 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_440 (Array Int Int))) (= (+ (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~A~0.base) c_~A~0.offset)) |c_thread1Thread1of1ForFork0_~tmp~0#1| (* (- 1) c_~res2~0)) 0)) is different from false [2022-01-18 12:22:50,653 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (= (+ |c_thread1Thread1of1ForFork0_~tmp~0#1| (* (- 1) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~A~0.base) c_~A~0.offset)) (* (- 1) c_~res2~0)) 0)) is different from false [2022-01-18 12:22:50,670 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:22:50,670 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 116 treesize of output 92 [2022-01-18 12:22:50,673 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 40 treesize of output 38 [2022-01-18 12:22:50,675 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 78 treesize of output 74 [2022-01-18 12:22:51,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:51,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905005935] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:22:51,183 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:22:51,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 20] total 46 [2022-01-18 12:22:51,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30677471] [2022-01-18 12:22:51,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:22:51,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-18 12:22:51,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:22:51,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-18 12:22:51,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1701, Unknown=2, NotChecked=170, Total=2070 [2022-01-18 12:22:51,185 INFO L87 Difference]: Start difference. First operand 12232 states and 43931 transitions. Second operand has 46 states, 46 states have (on average 5.717391304347826) internal successors, (263), 46 states have internal predecessors, (263), 0 states have call successors, (0), 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-01-18 12:22:53,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:53,237 INFO L93 Difference]: Finished difference Result 37903 states and 136252 transitions. [2022-01-18 12:22:53,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-18 12:22:53,237 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 5.717391304347826) internal successors, (263), 46 states have internal predecessors, (263), 0 states have call successors, (0), 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 124 [2022-01-18 12:22:53,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:53,340 INFO L225 Difference]: With dead ends: 37903 [2022-01-18 12:22:53,340 INFO L226 Difference]: Without dead ends: 37603 [2022-01-18 12:22:53,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 222 SyntacticMatches, 6 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1738 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=739, Invalid=5429, Unknown=2, NotChecked=310, Total=6480 [2022-01-18 12:22:53,342 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 1655 mSDsluCounter, 5704 mSDsCounter, 0 mSdLazyCounter, 2455 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1655 SdHoareTripleChecker+Valid, 5528 SdHoareTripleChecker+Invalid, 3524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 996 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-18 12:22:53,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1655 Valid, 5528 Invalid, 3524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2455 Invalid, 0 Unknown, 996 Unchecked, 0.9s Time] [2022-01-18 12:22:53,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37603 states. [2022-01-18 12:22:53,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37603 to 12580. [2022-01-18 12:22:53,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12580 states, 12579 states have (on average 3.601955640352969) internal successors, (45309), 12579 states have internal predecessors, (45309), 0 states have call successors, (0), 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-01-18 12:22:53,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12580 states to 12580 states and 45309 transitions. [2022-01-18 12:22:53,742 INFO L78 Accepts]: Start accepts. Automaton has 12580 states and 45309 transitions. Word has length 124 [2022-01-18 12:22:53,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:53,742 INFO L470 AbstractCegarLoop]: Abstraction has 12580 states and 45309 transitions. [2022-01-18 12:22:53,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 5.717391304347826) internal successors, (263), 46 states have internal predecessors, (263), 0 states have call successors, (0), 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-01-18 12:22:53,743 INFO L276 IsEmpty]: Start isEmpty. Operand 12580 states and 45309 transitions. [2022-01-18 12:22:53,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:22:53,769 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:53,769 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] [2022-01-18 12:22:53,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-18 12:22:53,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-01-18 12:22:53,991 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:22:53,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:53,991 INFO L85 PathProgramCache]: Analyzing trace with hash 879013074, now seen corresponding path program 4 times [2022-01-18 12:22:53,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:53,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317266271] [2022-01-18 12:22:53,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:53,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:54,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:22:54,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:54,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317266271] [2022-01-18 12:22:54,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317266271] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:22:54,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314095431] [2022-01-18 12:22:54,469 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 12:22:54,469 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:22:54,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:22:54,470 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:22:54,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-18 12:22:54,557 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 12:22:54,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:22:54,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 66 conjunts are in the unsatisfiable core [2022-01-18 12:22:54,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:22:55,058 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-18 12:22:55,318 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-01-18 12:22:55,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:22:55,473 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 18 treesize of output 20 [2022-01-18 12:22:55,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:22:55,534 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 18 treesize of output 20 [2022-01-18 12:22:55,639 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-01-18 12:22:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:22:55,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:22:55,855 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_477 (Array Int Int))) (= (+ (* (- 1) |c_thread1Thread1of1ForFork0_~tmp~0#1|) c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) c_~A~0.base) c_~A~0.offset)) 0)) is different from false [2022-01-18 12:22:55,871 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= (+ (* (- 1) |c_thread1Thread1of1ForFork0_~tmp~0#1|) c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) c_~A~0.base) c_~A~0.offset)) 0)) is different from false [2022-01-18 12:22:55,888 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= (+ c_~res2~0 (* (- 1) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) c_~A~0.base) c_~A~0.offset) (* (- 1) c_~res1~0)) 0)) is different from false [2022-01-18 12:22:55,896 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= 0 (+ (* (- 1) (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) c_~A~0.base) c_~A~0.offset) (* (- 1) c_~res1~0)))) is different from false [2022-01-18 12:22:55,907 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_475))) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) c_~A~0.base) c_~A~0.offset) (* (- 1) (select (select .cse0 c_~A~0.base) c_~A~0.offset)) (* (- 1) c_~res1~0))) 0)) is different from false [2022-01-18 12:22:55,952 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_475))) (+ (* (- 1) (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) c_~res2~0 (* (- 1) c_~res1~0) (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))))) is different from false [2022-01-18 12:22:55,960 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_475))) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res2~0 (* (- 1) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (* (- 1) c_~res1~0))) 0)) is different from false [2022-01-18 12:22:55,965 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_475))) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (* (- 1) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (* (- 1) c_~res1~0))) 0)) is different from false [2022-01-18 12:22:55,986 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:22:55,986 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 55 treesize of output 44 [2022-01-18 12:22:55,989 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 790 treesize of output 726 [2022-01-18 12:22:55,992 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 726 treesize of output 694 [2022-01-18 12:22:55,996 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 694 treesize of output 662 [2022-01-18 12:22:56,002 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 662 treesize of output 646 [2022-01-18 12:22:56,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-18 12:22:56,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314095431] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:22:56,406 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:22:56,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24, 22] total 54 [2022-01-18 12:22:56,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017405089] [2022-01-18 12:22:56,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:22:56,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-01-18 12:22:56,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:22:56,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-01-18 12:22:56,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1875, Unknown=8, NotChecked=760, Total=2862 [2022-01-18 12:22:56,408 INFO L87 Difference]: Start difference. First operand 12580 states and 45309 transitions. Second operand has 54 states, 54 states have (on average 5.37037037037037) internal successors, (290), 54 states have internal predecessors, (290), 0 states have call successors, (0), 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-01-18 12:22:58,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:58,376 INFO L93 Difference]: Finished difference Result 30299 states and 108654 transitions. [2022-01-18 12:22:58,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-01-18 12:22:58,376 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.37037037037037) internal successors, (290), 54 states have internal predecessors, (290), 0 states have call successors, (0), 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 124 [2022-01-18 12:22:58,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:58,454 INFO L225 Difference]: With dead ends: 30299 [2022-01-18 12:22:58,455 INFO L226 Difference]: Without dead ends: 30149 [2022-01-18 12:22:58,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 219 SyntacticMatches, 9 SemanticMatches, 78 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 1525 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=535, Invalid=4601, Unknown=8, NotChecked=1176, Total=6320 [2022-01-18 12:22:58,456 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 1336 mSDsluCounter, 5099 mSDsCounter, 0 mSdLazyCounter, 2204 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1336 SdHoareTripleChecker+Valid, 4966 SdHoareTripleChecker+Invalid, 6068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3833 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-18 12:22:58,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1336 Valid, 4966 Invalid, 6068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2204 Invalid, 0 Unknown, 3833 Unchecked, 0.8s Time] [2022-01-18 12:22:58,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30149 states. [2022-01-18 12:22:58,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30149 to 12580. [2022-01-18 12:22:58,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12580 states, 12579 states have (on average 3.601955640352969) internal successors, (45309), 12579 states have internal predecessors, (45309), 0 states have call successors, (0), 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-01-18 12:22:58,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12580 states to 12580 states and 45309 transitions. [2022-01-18 12:22:58,798 INFO L78 Accepts]: Start accepts. Automaton has 12580 states and 45309 transitions. Word has length 124 [2022-01-18 12:22:58,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:58,798 INFO L470 AbstractCegarLoop]: Abstraction has 12580 states and 45309 transitions. [2022-01-18 12:22:58,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.37037037037037) internal successors, (290), 54 states have internal predecessors, (290), 0 states have call successors, (0), 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-01-18 12:22:58,799 INFO L276 IsEmpty]: Start isEmpty. Operand 12580 states and 45309 transitions. [2022-01-18 12:22:58,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:22:58,821 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:58,821 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] [2022-01-18 12:22:58,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-01-18 12:22:59,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-18 12:22:59,023 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:22:59,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:59,024 INFO L85 PathProgramCache]: Analyzing trace with hash -732266808, now seen corresponding path program 2 times [2022-01-18 12:22:59,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:59,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852468131] [2022-01-18 12:22:59,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:59,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:59,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:22:59,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:59,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852468131] [2022-01-18 12:22:59,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852468131] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:22:59,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989554909] [2022-01-18 12:22:59,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 12:22:59,898 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:22:59,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:22:59,900 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:22:59,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-18 12:22:59,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 12:22:59,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:22:59,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 67 conjunts are in the unsatisfiable core [2022-01-18 12:22:59,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:23:00,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:23:00,853 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 18 treesize of output 20 [2022-01-18 12:23:00,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:23:00,945 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 18 treesize of output 20 [2022-01-18 12:23:01,203 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:23:01,204 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 17 treesize of output 17 [2022-01-18 12:23:01,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:23:01,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:23:01,994 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread3Thread1of1ForFork2_~i~2#1_41| Int) (v_ArrVal_511 (Array Int Int))) (or (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_41|) (< (+ |v_thread3Thread1of1ForFork2_~i~2#1_41| 1) c_~N~0) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_511) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_41| 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-01-18 12:23:02,075 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread3Thread1of1ForFork2_~i~2#1_41| Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (or (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_41|) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_510) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_511) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_41| 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< (+ |v_thread3Thread1of1ForFork2_~i~2#1_41| 1) c_~N~0))) is different from false [2022-01-18 12:23:02,142 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:23:02,142 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 116 treesize of output 92 [2022-01-18 12:23:02,146 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 76 treesize of output 64 [2022-01-18 12:23:02,153 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 34 treesize of output 28 [2022-01-18 12:23:02,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:23:02,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989554909] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:23:02,979 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:23:02,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 70 [2022-01-18 12:23:02,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73698618] [2022-01-18 12:23:02,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:23:02,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-01-18 12:23:02,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:23:02,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-01-18 12:23:02,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=4049, Unknown=2, NotChecked=266, Total=4830 [2022-01-18 12:23:02,981 INFO L87 Difference]: Start difference. First operand 12580 states and 45309 transitions. Second operand has 70 states, 70 states have (on average 4.385714285714286) internal successors, (307), 70 states have internal predecessors, (307), 0 states have call successors, (0), 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-01-18 12:23:41,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:23:41,626 INFO L93 Difference]: Finished difference Result 89801 states and 326321 transitions. [2022-01-18 12:23:41,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 473 states. [2022-01-18 12:23:41,627 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 4.385714285714286) internal successors, (307), 70 states have internal predecessors, (307), 0 states have call successors, (0), 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 124 [2022-01-18 12:23:41,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:23:41,904 INFO L225 Difference]: With dead ends: 89801 [2022-01-18 12:23:41,904 INFO L226 Difference]: Without dead ends: 89201 [2022-01-18 12:23:41,927 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 210 SyntacticMatches, 8 SemanticMatches, 521 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 118518 ImplicationChecksByTransitivity, 29.3s TimeCoverageRelationStatistics Valid=21399, Invalid=249527, Unknown=2, NotChecked=2078, Total=273006 [2022-01-18 12:23:41,927 INFO L933 BasicCegarLoop]: 669 mSDtfsCounter, 4982 mSDsluCounter, 20796 mSDsCounter, 0 mSdLazyCounter, 18787 mSolverCounterSat, 467 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4982 SdHoareTripleChecker+Valid, 19364 SdHoareTripleChecker+Invalid, 24904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 467 IncrementalHoareTripleChecker+Valid, 18787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5650 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-01-18 12:23:41,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4982 Valid, 19364 Invalid, 24904 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [467 Valid, 18787 Invalid, 0 Unknown, 5650 Unchecked, 8.0s Time] [2022-01-18 12:23:42,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89201 states. [2022-01-18 12:23:42,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89201 to 12803. [2022-01-18 12:23:42,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12803 states, 12802 states have (on average 3.6176378690829556) internal successors, (46313), 12802 states have internal predecessors, (46313), 0 states have call successors, (0), 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-01-18 12:23:43,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12803 states to 12803 states and 46313 transitions. [2022-01-18 12:23:43,002 INFO L78 Accepts]: Start accepts. Automaton has 12803 states and 46313 transitions. Word has length 124 [2022-01-18 12:23:43,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:23:43,002 INFO L470 AbstractCegarLoop]: Abstraction has 12803 states and 46313 transitions. [2022-01-18 12:23:43,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 4.385714285714286) internal successors, (307), 70 states have internal predecessors, (307), 0 states have call successors, (0), 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-01-18 12:23:43,002 INFO L276 IsEmpty]: Start isEmpty. Operand 12803 states and 46313 transitions. [2022-01-18 12:23:43,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:23:43,025 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:23:43,025 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] [2022-01-18 12:23:43,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-18 12:23:43,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-18 12:23:43,234 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:23:43,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:23:43,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1913273718, now seen corresponding path program 3 times [2022-01-18 12:23:43,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:23:43,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453718618] [2022-01-18 12:23:43,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:23:43,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:23:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:23:44,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:23:44,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:23:44,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453718618] [2022-01-18 12:23:44,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453718618] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:23:44,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134977351] [2022-01-18 12:23:44,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 12:23:44,019 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:23:44,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:23:44,020 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:23:44,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-18 12:23:44,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 12:23:44,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:23:44,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 67 conjunts are in the unsatisfiable core [2022-01-18 12:23:44,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:23:44,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:23:44,897 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 18 treesize of output 20 [2022-01-18 12:23:44,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:23:44,987 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 18 treesize of output 20 [2022-01-18 12:23:45,141 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:23:45,142 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 21 treesize of output 21 [2022-01-18 12:23:45,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:23:45,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:23:45,967 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_545 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_44| Int)) (or (< (+ |v_thread3Thread1of1ForFork2_~i~2#1_44| 1) c_~N~0) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_545) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_44| 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_44|))) is different from false [2022-01-18 12:23:46,022 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_545 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_44| Int) (v_ArrVal_544 (Array Int Int))) (or (< (+ |v_thread3Thread1of1ForFork2_~i~2#1_44| 1) c_~N~0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_44|) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_544) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_545) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_44| 4))))))) is different from false [2022-01-18 12:23:46,071 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:23:46,071 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 242 treesize of output 178 [2022-01-18 12:23:46,076 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 81 treesize of output 69 [2022-01-18 12:23:46,079 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 150 treesize of output 126 [2022-01-18 12:23:46,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:23:46,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134977351] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:23:46,899 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:23:46,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 70 [2022-01-18 12:23:46,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623432557] [2022-01-18 12:23:46,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:23:46,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-01-18 12:23:46,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:23:46,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-01-18 12:23:46,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=4046, Unknown=2, NotChecked=266, Total=4830 [2022-01-18 12:23:46,901 INFO L87 Difference]: Start difference. First operand 12803 states and 46313 transitions. Second operand has 70 states, 70 states have (on average 4.385714285714286) internal successors, (307), 70 states have internal predecessors, (307), 0 states have call successors, (0), 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-01-18 12:24:19,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:24:19,537 INFO L93 Difference]: Finished difference Result 72952 states and 266277 transitions. [2022-01-18 12:24:19,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 431 states. [2022-01-18 12:24:19,537 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 4.385714285714286) internal successors, (307), 70 states have internal predecessors, (307), 0 states have call successors, (0), 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 124 [2022-01-18 12:24:19,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:24:19,793 INFO L225 Difference]: With dead ends: 72952 [2022-01-18 12:24:19,793 INFO L226 Difference]: Without dead ends: 72652 [2022-01-18 12:24:19,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 730 GetRequests, 220 SyntacticMatches, 33 SemanticMatches, 477 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 101099 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=20521, Invalid=206537, Unknown=2, NotChecked=1902, Total=228962 [2022-01-18 12:24:19,813 INFO L933 BasicCegarLoop]: 563 mSDtfsCounter, 4524 mSDsluCounter, 17572 mSDsCounter, 0 mSdLazyCounter, 12271 mSolverCounterSat, 432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4524 SdHoareTripleChecker+Valid, 16496 SdHoareTripleChecker+Invalid, 19162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 12271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6459 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-01-18 12:24:19,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4524 Valid, 16496 Invalid, 19162 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [432 Valid, 12271 Invalid, 0 Unknown, 6459 Unchecked, 5.5s Time] [2022-01-18 12:24:19,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72652 states. [2022-01-18 12:24:20,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72652 to 13141. [2022-01-18 12:24:20,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13141 states, 13140 states have (on average 3.6317351598173517) internal successors, (47721), 13140 states have internal predecessors, (47721), 0 states have call successors, (0), 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-01-18 12:24:20,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13141 states to 13141 states and 47721 transitions. [2022-01-18 12:24:20,606 INFO L78 Accepts]: Start accepts. Automaton has 13141 states and 47721 transitions. Word has length 124 [2022-01-18 12:24:20,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:24:20,606 INFO L470 AbstractCegarLoop]: Abstraction has 13141 states and 47721 transitions. [2022-01-18 12:24:20,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 4.385714285714286) internal successors, (307), 70 states have internal predecessors, (307), 0 states have call successors, (0), 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-01-18 12:24:20,606 INFO L276 IsEmpty]: Start isEmpty. Operand 13141 states and 47721 transitions. [2022-01-18 12:24:20,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:24:20,631 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:24:20,631 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] [2022-01-18 12:24:20,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-01-18 12:24:20,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:24:20,832 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:24:20,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:24:20,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1254294472, now seen corresponding path program 4 times [2022-01-18 12:24:20,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:24:20,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175721602] [2022-01-18 12:24:20,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:24:20,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:24:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:24:21,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:24:21,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:24:21,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175721602] [2022-01-18 12:24:21,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175721602] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:24:21,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545099606] [2022-01-18 12:24:21,694 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 12:24:21,694 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:24:21,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:24:21,695 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:24:21,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-01-18 12:24:21,793 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 12:24:21,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:24:21,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-01-18 12:24:21,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:24:22,467 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 15 treesize of output 11 [2022-01-18 12:24:22,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, 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-01-18 12:24:23,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:24:23,188 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 18 treesize of output 20 [2022-01-18 12:24:23,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:24:23,282 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 18 treesize of output 20 [2022-01-18 12:24:23,430 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:24:23,430 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 27 treesize of output 27 [2022-01-18 12:24:23,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:24:23,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:24:24,097 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_582 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 12:24:24,167 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 12:24:24,225 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 12:24:24,255 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 12:24:24,279 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_580))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ c_~res1~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 12:24:24,443 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_580))) (= (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 12:24:24,475 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_580))) (= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 12:24:24,493 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_580))) (= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) |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|))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 12:24:24,748 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:24:24,748 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 55 treesize of output 44 [2022-01-18 12:24:24,755 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:24:24,756 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 410 treesize of output 374 [2022-01-18 12:24:24,760 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 362 treesize of output 314 [2022-01-18 12:24:24,763 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-01-18 12:24:24,772 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:24:24,772 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 290 treesize of output 274 [2022-01-18 12:24:25,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-18 12:24:25,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545099606] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:24:25,992 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:24:25,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 85 [2022-01-18 12:24:25,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634956306] [2022-01-18 12:24:25,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:24:25,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-01-18 12:24:25,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:24:25,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-01-18 12:24:25,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=5417, Unknown=11, NotChecked=1256, Total=7140 [2022-01-18 12:24:25,994 INFO L87 Difference]: Start difference. First operand 13141 states and 47721 transitions. Second operand has 85 states, 85 states have (on average 3.458823529411765) internal successors, (294), 85 states have internal predecessors, (294), 0 states have call successors, (0), 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-01-18 12:24:36,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:24:36,490 INFO L93 Difference]: Finished difference Result 35886 states and 129652 transitions. [2022-01-18 12:24:36,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-01-18 12:24:36,490 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 3.458823529411765) internal successors, (294), 85 states have internal predecessors, (294), 0 states have call successors, (0), 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 124 [2022-01-18 12:24:36,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:24:36,599 INFO L225 Difference]: With dead ends: 35886 [2022-01-18 12:24:36,599 INFO L226 Difference]: Without dead ends: 35736 [2022-01-18 12:24:36,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 200 SyntacticMatches, 7 SemanticMatches, 146 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 6265 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=1665, Invalid=17816, Unknown=11, NotChecked=2264, Total=21756 [2022-01-18 12:24:36,602 INFO L933 BasicCegarLoop]: 326 mSDtfsCounter, 2378 mSDsluCounter, 10050 mSDsCounter, 0 mSdLazyCounter, 4262 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2378 SdHoareTripleChecker+Valid, 9629 SdHoareTripleChecker+Invalid, 9589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 4262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5204 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-18 12:24:36,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2378 Valid, 9629 Invalid, 9589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 4262 Invalid, 0 Unknown, 5204 Unchecked, 1.8s Time] [2022-01-18 12:24:36,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35736 states. [2022-01-18 12:24:36,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35736 to 13355. [2022-01-18 12:24:36,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13355 states, 13354 states have (on average 3.635015725625281) internal successors, (48542), 13354 states have internal predecessors, (48542), 0 states have call successors, (0), 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-01-18 12:24:37,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13355 states to 13355 states and 48542 transitions. [2022-01-18 12:24:37,030 INFO L78 Accepts]: Start accepts. Automaton has 13355 states and 48542 transitions. Word has length 124 [2022-01-18 12:24:37,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:24:37,030 INFO L470 AbstractCegarLoop]: Abstraction has 13355 states and 48542 transitions. [2022-01-18 12:24:37,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 3.458823529411765) internal successors, (294), 85 states have internal predecessors, (294), 0 states have call successors, (0), 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-01-18 12:24:37,030 INFO L276 IsEmpty]: Start isEmpty. Operand 13355 states and 48542 transitions. [2022-01-18 12:24:37,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:24:37,056 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:24:37,056 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] [2022-01-18 12:24:37,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-01-18 12:24:37,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:24:37,256 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:24:37,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:24:37,257 INFO L85 PathProgramCache]: Analyzing trace with hash 2051171398, now seen corresponding path program 5 times [2022-01-18 12:24:37,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:24:37,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734277899] [2022-01-18 12:24:37,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:24:37,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:24:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:24:38,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:24:38,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:24:38,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734277899] [2022-01-18 12:24:38,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734277899] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:24:38,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827850898] [2022-01-18 12:24:38,283 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 12:24:38,283 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:24:38,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:24:38,284 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:24:38,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-01-18 12:24:38,379 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-18 12:24:38,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:24:38,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 83 conjunts are in the unsatisfiable core [2022-01-18 12:24:38,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:24:38,424 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-01-18 12:24:38,459 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 12:24:38,459 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-01-18 12:24:38,514 INFO L353 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-01-18 12:24:38,515 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 30 [2022-01-18 12:24:39,098 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-01-18 12:24:39,098 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 24 treesize of output 34 [2022-01-18 12:24:39,335 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-01-18 12:24:39,898 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-01-18 12:24:40,200 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 18 treesize of output 20 [2022-01-18 12:24:40,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:24:40,315 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 18 treesize of output 20 [2022-01-18 12:24:40,472 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:24:40,472 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 27 treesize of output 27 [2022-01-18 12:24:40,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:24:40,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:24:41,191 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int)) (or (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 12:24:41,285 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int))) (or (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 12:24:41,357 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 12:24:41,376 WARN L838 $PredicateComparison]: unable to prove that (or (not (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-01-18 12:24:41,396 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)) (< (+ ~M~0 1) c_~N~0))) (not (< 0 c_~N~0))) is different from false [2022-01-18 12:24:41,434 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_620))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0))) (< (+ ~M~0 1) c_~N~0))) (not (< 0 c_~N~0))) is different from false [2022-01-18 12:24:41,641 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_620))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (+ (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-01-18 12:24:41,686 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_620))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-01-18 12:24:41,720 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (or (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_620))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) |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_~res2~0) (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-01-18 12:24:42,077 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:24:42,077 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 55 treesize of output 44 [2022-01-18 12:24:42,091 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:24:42,092 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 1670 treesize of output 1490 [2022-01-18 12:24:42,102 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 1478 treesize of output 1382 [2022-01-18 12:24:42,110 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 1382 treesize of output 1190 [2022-01-18 12:24:42,127 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:24:42,127 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 1190 treesize of output 1090 [2022-01-18 12:24:47,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-18 12:24:47,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827850898] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:24:47,889 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:24:47,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 34] total 85 [2022-01-18 12:24:47,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924482380] [2022-01-18 12:24:47,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:24:47,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-01-18 12:24:47,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:24:47,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-01-18 12:24:47,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=5300, Unknown=11, NotChecked=1404, Total=7140 [2022-01-18 12:24:47,891 INFO L87 Difference]: Start difference. First operand 13355 states and 48542 transitions. Second operand has 85 states, 85 states have (on average 3.447058823529412) internal successors, (293), 85 states have internal predecessors, (293), 0 states have call successors, (0), 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-01-18 12:24:55,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:24:55,426 INFO L93 Difference]: Finished difference Result 23721 states and 85469 transitions. [2022-01-18 12:24:55,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-01-18 12:24:55,426 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 3.447058823529412) internal successors, (293), 85 states have internal predecessors, (293), 0 states have call successors, (0), 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 124 [2022-01-18 12:24:55,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:24:55,489 INFO L225 Difference]: With dead ends: 23721 [2022-01-18 12:24:55,489 INFO L226 Difference]: Without dead ends: 23571 [2022-01-18 12:24:55,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 9 SemanticMatches, 121 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 3779 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1212, Invalid=11695, Unknown=11, NotChecked=2088, Total=15006 [2022-01-18 12:24:55,491 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 1355 mSDsluCounter, 8168 mSDsCounter, 0 mSdLazyCounter, 2830 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 7894 SdHoareTripleChecker+Invalid, 7136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4250 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-18 12:24:55,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1355 Valid, 7894 Invalid, 7136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2830 Invalid, 0 Unknown, 4250 Unchecked, 1.2s Time] [2022-01-18 12:24:55,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23571 states. [2022-01-18 12:24:55,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23571 to 13311. [2022-01-18 12:24:55,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13311 states, 13310 states have (on average 3.6322314049586777) internal successors, (48345), 13310 states have internal predecessors, (48345), 0 states have call successors, (0), 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-01-18 12:24:55,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13311 states to 13311 states and 48345 transitions. [2022-01-18 12:24:55,834 INFO L78 Accepts]: Start accepts. Automaton has 13311 states and 48345 transitions. Word has length 124 [2022-01-18 12:24:55,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:24:55,835 INFO L470 AbstractCegarLoop]: Abstraction has 13311 states and 48345 transitions. [2022-01-18 12:24:55,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 3.447058823529412) internal successors, (293), 85 states have internal predecessors, (293), 0 states have call successors, (0), 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-01-18 12:24:55,835 INFO L276 IsEmpty]: Start isEmpty. Operand 13311 states and 48345 transitions. [2022-01-18 12:24:55,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:24:55,860 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:24:55,860 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] [2022-01-18 12:24:55,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-01-18 12:24:56,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:24:56,062 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:24:56,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:24:56,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1783840602, now seen corresponding path program 6 times [2022-01-18 12:24:56,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:24:56,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345667209] [2022-01-18 12:24:56,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:24:56,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:24:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:24:56,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:24:56,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:24:56,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345667209] [2022-01-18 12:24:56,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345667209] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:24:56,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006835238] [2022-01-18 12:24:56,943 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 12:24:56,943 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:24:56,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:24:56,945 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:24:56,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-01-18 12:24:57,051 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-01-18 12:24:57,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:24:57,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 72 conjunts are in the unsatisfiable core [2022-01-18 12:24:57,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:24:57,110 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-01-18 12:24:57,333 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 12:24:57,333 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-01-18 12:24:57,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:24:57,882 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 18 treesize of output 20 [2022-01-18 12:24:57,971 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 18 treesize of output 20 [2022-01-18 12:24:58,117 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:24:58,118 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 27 treesize of output 27 [2022-01-18 12:24:58,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:24:58,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:24:58,967 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_657 (Array Int Int)) (~M~0 Int)) (or (< 0 ~M~0) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_657) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 12:24:59,030 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_657 (Array Int Int)) (~M~0 Int)) (or (< 0 ~M~0) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_656) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_657) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 12:24:59,086 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:24:59,086 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 116 treesize of output 92 [2022-01-18 12:24:59,090 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 76 treesize of output 64 [2022-01-18 12:24:59,095 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 34 treesize of output 28 [2022-01-18 12:25:00,407 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-01-18 12:25:00,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:25:00,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006835238] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:25:00,471 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:25:00,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 71 [2022-01-18 12:25:00,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336865601] [2022-01-18 12:25:00,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:25:00,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-01-18 12:25:00,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:25:00,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-01-18 12:25:00,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=4287, Unknown=2, NotChecked=270, Total=4970 [2022-01-18 12:25:00,473 INFO L87 Difference]: Start difference. First operand 13311 states and 48345 transitions. Second operand has 71 states, 71 states have (on average 4.436619718309859) internal successors, (315), 71 states have internal predecessors, (315), 0 states have call successors, (0), 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-01-18 12:25:18,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:25:18,449 INFO L93 Difference]: Finished difference Result 46956 states and 170767 transitions. [2022-01-18 12:25:18,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2022-01-18 12:25:18,449 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 4.436619718309859) internal successors, (315), 71 states have internal predecessors, (315), 0 states have call successors, (0), 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 124 [2022-01-18 12:25:18,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:25:18,585 INFO L225 Difference]: With dead ends: 46956 [2022-01-18 12:25:18,586 INFO L226 Difference]: Without dead ends: 46521 [2022-01-18 12:25:18,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 213 SyntacticMatches, 24 SemanticMatches, 249 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 22581 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=7433, Invalid=54325, Unknown=2, NotChecked=990, Total=62750 [2022-01-18 12:25:18,592 INFO L933 BasicCegarLoop]: 427 mSDtfsCounter, 2911 mSDsluCounter, 17291 mSDsCounter, 0 mSdLazyCounter, 6481 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2911 SdHoareTripleChecker+Valid, 16356 SdHoareTripleChecker+Invalid, 18788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 6481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12174 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-01-18 12:25:18,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2911 Valid, 16356 Invalid, 18788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 6481 Invalid, 0 Unknown, 12174 Unchecked, 3.0s Time] [2022-01-18 12:25:18,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46521 states. [2022-01-18 12:25:19,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46521 to 13892. [2022-01-18 12:25:19,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13892 states, 13891 states have (on average 3.653876610755165) internal successors, (50756), 13891 states have internal predecessors, (50756), 0 states have call successors, (0), 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-01-18 12:25:19,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13892 states to 13892 states and 50756 transitions. [2022-01-18 12:25:19,154 INFO L78 Accepts]: Start accepts. Automaton has 13892 states and 50756 transitions. Word has length 124 [2022-01-18 12:25:19,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:25:19,154 INFO L470 AbstractCegarLoop]: Abstraction has 13892 states and 50756 transitions. [2022-01-18 12:25:19,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 4.436619718309859) internal successors, (315), 71 states have internal predecessors, (315), 0 states have call successors, (0), 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-01-18 12:25:19,155 INFO L276 IsEmpty]: Start isEmpty. Operand 13892 states and 50756 transitions. [2022-01-18 12:25:19,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:25:19,181 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:25:19,181 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] [2022-01-18 12:25:19,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-01-18 12:25:19,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:25:19,382 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:25:19,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:25:19,382 INFO L85 PathProgramCache]: Analyzing trace with hash -369162054, now seen corresponding path program 7 times [2022-01-18 12:25:19,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:25:19,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259051619] [2022-01-18 12:25:19,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:25:19,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:25:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:25:20,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:25:20,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:25:20,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259051619] [2022-01-18 12:25:20,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259051619] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:25:20,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886102267] [2022-01-18 12:25:20,209 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-18 12:25:20,209 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:25:20,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:25:20,210 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:25:20,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-01-18 12:25:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:25:20,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 77 conjunts are in the unsatisfiable core [2022-01-18 12:25:20,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:25:21,060 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 15 treesize of output 11 [2022-01-18 12:25:21,557 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-01-18 12:25:21,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:25:21,794 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 18 treesize of output 20 [2022-01-18 12:25:21,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:25:21,892 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 18 treesize of output 20 [2022-01-18 12:25:22,053 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:25:22,053 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 27 treesize of output 27 [2022-01-18 12:25:22,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:25:22,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:25:22,851 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_694 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0)))) is different from false [2022-01-18 12:25:22,910 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) is different from false [2022-01-18 12:25:22,962 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0) (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) is different from false [2022-01-18 12:25:22,986 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0) (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) is different from false [2022-01-18 12:25:23,011 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_692))) (= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))))))) is different from false [2022-01-18 12:25:23,133 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_692))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~res2~0) (+ (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0))))) is different from false [2022-01-18 12:25:23,160 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_692))) (= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res1~0) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~res2~0))))) is different from false [2022-01-18 12:25:23,175 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_692))) (= (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) |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|))))))) is different from false [2022-01-18 12:25:23,444 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:25:23,444 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 55 treesize of output 44 [2022-01-18 12:25:23,454 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:25:23,454 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 410 treesize of output 374 [2022-01-18 12:25:23,459 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 362 treesize of output 314 [2022-01-18 12:25:23,463 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-01-18 12:25:23,473 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:25:23,474 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 290 treesize of output 274 [2022-01-18 12:25:25,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-18 12:25:25,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886102267] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:25:25,255 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:25:25,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 84 [2022-01-18 12:25:25,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321659772] [2022-01-18 12:25:25,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:25:25,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-01-18 12:25:25,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:25:25,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-01-18 12:25:25,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=5244, Unknown=11, NotChecked=1240, Total=6972 [2022-01-18 12:25:25,257 INFO L87 Difference]: Start difference. First operand 13892 states and 50756 transitions. Second operand has 84 states, 84 states have (on average 3.630952380952381) internal successors, (305), 84 states have internal predecessors, (305), 0 states have call successors, (0), 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-01-18 12:25:30,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:25:30,884 INFO L93 Difference]: Finished difference Result 32580 states and 118215 transitions. [2022-01-18 12:25:30,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-01-18 12:25:30,885 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 3.630952380952381) internal successors, (305), 84 states have internal predecessors, (305), 0 states have call successors, (0), 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 124 [2022-01-18 12:25:30,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:25:30,979 INFO L225 Difference]: With dead ends: 32580 [2022-01-18 12:25:30,979 INFO L226 Difference]: Without dead ends: 32430 [2022-01-18 12:25:30,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 200 SyntacticMatches, 7 SemanticMatches, 136 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 5352 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1475, Invalid=15316, Unknown=11, NotChecked=2104, Total=18906 [2022-01-18 12:25:30,982 INFO L933 BasicCegarLoop]: 292 mSDtfsCounter, 1804 mSDsluCounter, 9411 mSDsCounter, 0 mSdLazyCounter, 4238 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1804 SdHoareTripleChecker+Valid, 9093 SdHoareTripleChecker+Invalid, 9249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 4238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4933 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-18 12:25:30,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1804 Valid, 9093 Invalid, 9249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 4238 Invalid, 0 Unknown, 4933 Unchecked, 1.8s Time] [2022-01-18 12:25:31,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32430 states. [2022-01-18 12:25:31,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32430 to 13886. [2022-01-18 12:25:31,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13886 states, 13885 states have (on average 3.6503420957868205) internal successors, (50685), 13885 states have internal predecessors, (50685), 0 states have call successors, (0), 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-01-18 12:25:31,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13886 states to 13886 states and 50685 transitions. [2022-01-18 12:25:31,371 INFO L78 Accepts]: Start accepts. Automaton has 13886 states and 50685 transitions. Word has length 124 [2022-01-18 12:25:31,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:25:31,371 INFO L470 AbstractCegarLoop]: Abstraction has 13886 states and 50685 transitions. [2022-01-18 12:25:31,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 3.630952380952381) internal successors, (305), 84 states have internal predecessors, (305), 0 states have call successors, (0), 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-01-18 12:25:31,371 INFO L276 IsEmpty]: Start isEmpty. Operand 13886 states and 50685 transitions. [2022-01-18 12:25:31,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:25:31,399 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:25:31,399 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] [2022-01-18 12:25:31,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-01-18 12:25:31,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:25:31,600 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:25:31,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:25:31,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1457504890, now seen corresponding path program 8 times [2022-01-18 12:25:31,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:25:31,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261959747] [2022-01-18 12:25:31,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:25:31,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:25:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:25:32,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:25:32,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:25:32,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261959747] [2022-01-18 12:25:32,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261959747] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:25:32,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883138312] [2022-01-18 12:25:32,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 12:25:32,544 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:25:32,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:25:32,545 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:25:32,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-01-18 12:25:32,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 12:25:32,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:25:32,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 73 conjunts are in the unsatisfiable core [2022-01-18 12:25:32,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:25:32,706 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-01-18 12:25:32,740 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 12:25:32,741 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-01-18 12:25:32,991 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-01-18 12:25:32,991 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-01-18 12:25:33,559 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 18 treesize of output 20 [2022-01-18 12:25:33,640 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 18 treesize of output 20 [2022-01-18 12:25:33,787 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:25:33,787 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 27 treesize of output 27 [2022-01-18 12:25:34,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:25:34,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:25:34,661 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_730 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_730) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0)))) is different from false [2022-01-18 12:25:34,755 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_729) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_730) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0)))) is different from false [2022-01-18 12:25:34,839 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:25:34,839 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 116 treesize of output 92 [2022-01-18 12:25:34,843 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 76 treesize of output 64 [2022-01-18 12:25:34,850 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 34 treesize of output 28 [2022-01-18 12:25:35,941 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-01-18 12:25:35,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:25:35,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883138312] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:25:35,977 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:25:35,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 71 [2022-01-18 12:25:35,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91070818] [2022-01-18 12:25:35,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:25:35,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-01-18 12:25:35,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:25:35,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-01-18 12:25:35,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=4257, Unknown=2, NotChecked=270, Total=4970 [2022-01-18 12:25:35,979 INFO L87 Difference]: Start difference. First operand 13886 states and 50685 transitions. Second operand has 71 states, 71 states have (on average 4.408450704225352) internal successors, (313), 71 states have internal predecessors, (313), 0 states have call successors, (0), 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-01-18 12:25:55,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:25:55,371 INFO L93 Difference]: Finished difference Result 45671 states and 167359 transitions. [2022-01-18 12:25:55,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2022-01-18 12:25:55,372 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 4.408450704225352) internal successors, (313), 71 states have internal predecessors, (313), 0 states have call successors, (0), 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 124 [2022-01-18 12:25:55,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:25:55,515 INFO L225 Difference]: With dead ends: 45671 [2022-01-18 12:25:55,515 INFO L226 Difference]: Without dead ends: 45371 [2022-01-18 12:25:55,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 220 SyntacticMatches, 15 SemanticMatches, 275 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 28816 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=10241, Invalid=65115, Unknown=2, NotChecked=1094, Total=76452 [2022-01-18 12:25:55,524 INFO L933 BasicCegarLoop]: 437 mSDtfsCounter, 2925 mSDsluCounter, 13205 mSDsCounter, 0 mSdLazyCounter, 5462 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2925 SdHoareTripleChecker+Valid, 12442 SdHoareTripleChecker+Invalid, 16342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 5462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10722 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-01-18 12:25:55,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2925 Valid, 12442 Invalid, 16342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 5462 Invalid, 0 Unknown, 10722 Unchecked, 2.7s Time] [2022-01-18 12:25:55,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45371 states. [2022-01-18 12:25:56,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45371 to 14264. [2022-01-18 12:25:56,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14264 states, 14263 states have (on average 3.6511252892098436) internal successors, (52076), 14263 states have internal predecessors, (52076), 0 states have call successors, (0), 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-01-18 12:25:56,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14264 states to 14264 states and 52076 transitions. [2022-01-18 12:25:56,082 INFO L78 Accepts]: Start accepts. Automaton has 14264 states and 52076 transitions. Word has length 124 [2022-01-18 12:25:56,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:25:56,082 INFO L470 AbstractCegarLoop]: Abstraction has 14264 states and 52076 transitions. [2022-01-18 12:25:56,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 4.408450704225352) internal successors, (313), 71 states have internal predecessors, (313), 0 states have call successors, (0), 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-01-18 12:25:56,082 INFO L276 IsEmpty]: Start isEmpty. Operand 14264 states and 52076 transitions. [2022-01-18 12:25:56,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:25:56,107 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:25:56,107 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] [2022-01-18 12:25:56,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-01-18 12:25:56,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:25:56,308 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:25:56,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:25:56,308 INFO L85 PathProgramCache]: Analyzing trace with hash -89866212, now seen corresponding path program 9 times [2022-01-18 12:25:56,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:25:56,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822102877] [2022-01-18 12:25:56,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:25:56,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:25:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:25:57,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:25:57,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:25:57,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822102877] [2022-01-18 12:25:57,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822102877] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:25:57,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580281036] [2022-01-18 12:25:57,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 12:25:57,156 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:25:57,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:25:57,157 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:25:57,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-01-18 12:25:57,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 12:25:57,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:25:57,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-01-18 12:25:57,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:25:57,344 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-01-18 12:25:57,384 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 12:25:57,384 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-01-18 12:25:57,753 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-01-18 12:25:57,753 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-01-18 12:25:57,916 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-01-18 12:25:58,184 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-01-18 12:25:58,399 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 18 treesize of output 20 [2022-01-18 12:25:58,476 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 18 treesize of output 20 [2022-01-18 12:25:58,621 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:25:58,621 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 27 treesize of output 27 [2022-01-18 12:25:59,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:25:59,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:25:59,431 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-01-18 12:25:59,501 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-01-18 12:25:59,560 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)))) is different from false [2022-01-18 12:25:59,574 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) |c_thread1Thread1of1ForFork0_~i~0#1|) (< 0 ~M~0) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)))) is different from false [2022-01-18 12:25:59,588 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) 0) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)) (< 0 ~M~0))) is different from false [2022-01-18 12:25:59,615 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_767))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0))))) is different from false [2022-01-18 12:25:59,746 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_767))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)))))) is different from false [2022-01-18 12:25:59,770 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_767))) (= (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))))) is different from false [2022-01-18 12:25:59,783 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_767))) (= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) |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|))))))) is different from false [2022-01-18 12:25:59,847 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:25:59,847 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 55 treesize of output 44 [2022-01-18 12:25:59,856 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-01-18 12:25:59,856 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 1670 treesize of output 1482 [2022-01-18 12:25:59,868 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 1478 treesize of output 1382 [2022-01-18 12:25:59,874 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 1382 treesize of output 1190 [2022-01-18 12:25:59,889 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-01-18 12:25:59,889 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 1190 treesize of output 1082 [2022-01-18 12:26:03,730 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-01-18 12:26:03,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-18 12:26:03,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580281036] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:26:03,752 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:26:03,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 28] total 75 [2022-01-18 12:26:03,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313593940] [2022-01-18 12:26:03,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:26:03,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-01-18 12:26:03,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:26:03,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-01-18 12:26:03,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=3909, Unknown=9, NotChecked=1224, Total=5550 [2022-01-18 12:26:03,754 INFO L87 Difference]: Start difference. First operand 14264 states and 52076 transitions. Second operand has 75 states, 75 states have (on average 4.16) internal successors, (312), 75 states have internal predecessors, (312), 0 states have call successors, (0), 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-01-18 12:26:23,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:26:23,951 INFO L93 Difference]: Finished difference Result 40970 states and 149500 transitions. [2022-01-18 12:26:23,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2022-01-18 12:26:23,951 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 4.16) internal successors, (312), 75 states have internal predecessors, (312), 0 states have call successors, (0), 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 124 [2022-01-18 12:26:23,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:26:24,063 INFO L225 Difference]: With dead ends: 40970 [2022-01-18 12:26:24,063 INFO L226 Difference]: Without dead ends: 40670 [2022-01-18 12:26:24,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 228 SyntacticMatches, 15 SemanticMatches, 259 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 23295 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=7904, Invalid=55375, Unknown=9, NotChecked=4572, Total=67860 [2022-01-18 12:26:24,066 INFO L933 BasicCegarLoop]: 428 mSDtfsCounter, 3010 mSDsluCounter, 11920 mSDsCounter, 0 mSdLazyCounter, 5288 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3010 SdHoareTripleChecker+Valid, 11358 SdHoareTripleChecker+Invalid, 19772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 5288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14362 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-01-18 12:26:24,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3010 Valid, 11358 Invalid, 19772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 5288 Invalid, 0 Unknown, 14362 Unchecked, 2.7s Time] [2022-01-18 12:26:24,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40670 states. [2022-01-18 12:26:24,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40670 to 14094. [2022-01-18 12:26:24,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14094 states, 14093 states have (on average 3.6449301071453912) internal successors, (51368), 14093 states have internal predecessors, (51368), 0 states have call successors, (0), 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-01-18 12:26:24,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14094 states to 14094 states and 51368 transitions. [2022-01-18 12:26:24,515 INFO L78 Accepts]: Start accepts. Automaton has 14094 states and 51368 transitions. Word has length 124 [2022-01-18 12:26:24,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:26:24,516 INFO L470 AbstractCegarLoop]: Abstraction has 14094 states and 51368 transitions. [2022-01-18 12:26:24,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 4.16) internal successors, (312), 75 states have internal predecessors, (312), 0 states have call successors, (0), 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-01-18 12:26:24,516 INFO L276 IsEmpty]: Start isEmpty. Operand 14094 states and 51368 transitions. [2022-01-18 12:26:24,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:26:24,541 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:26:24,541 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] [2022-01-18 12:26:24,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-01-18 12:26:24,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-01-18 12:26:24,742 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:26:24,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:26:24,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1002033640, now seen corresponding path program 10 times [2022-01-18 12:26:24,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:26:24,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998432170] [2022-01-18 12:26:24,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:26:24,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:26:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:26:25,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:26:25,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:26:25,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998432170] [2022-01-18 12:26:25,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998432170] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:26:25,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986882063] [2022-01-18 12:26:25,504 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 12:26:25,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:26:25,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:26:25,506 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:26:25,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-01-18 12:26:25,607 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 12:26:25,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:26:25,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-01-18 12:26:25,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:26:26,278 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 15 treesize of output 11 [2022-01-18 12:26:26,782 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-01-18 12:26:27,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:26:27,013 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 18 treesize of output 20 [2022-01-18 12:26:27,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:26:27,110 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 18 treesize of output 20 [2022-01-18 12:26:27,267 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:26:27,267 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 27 treesize of output 27 [2022-01-18 12:26:27,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:26:27,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:26:27,909 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_806 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 12:26:27,965 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 12:26:28,019 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 12:26:28,049 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 12:26:28,073 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_804))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 12:26:28,196 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_804))) (= (+ (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~res2~0))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 12:26:28,222 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_804))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~res2~0) (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) is different from false [2022-01-18 12:26:28,236 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_804))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) |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_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 12:26:28,492 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:26:28,493 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 55 treesize of output 44 [2022-01-18 12:26:28,504 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:26:28,504 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 830 treesize of output 746 [2022-01-18 12:26:28,514 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 734 treesize of output 686 [2022-01-18 12:26:28,521 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 686 treesize of output 590 [2022-01-18 12:26:28,535 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:26:28,535 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 590 treesize of output 546 [2022-01-18 12:26:42,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-18 12:26:42,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986882063] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:26:42,409 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:26:42,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 85 [2022-01-18 12:26:42,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713391199] [2022-01-18 12:26:42,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:26:42,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-01-18 12:26:42,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:26:42,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-01-18 12:26:42,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=5341, Unknown=11, NotChecked=1256, Total=7140 [2022-01-18 12:26:42,411 INFO L87 Difference]: Start difference. First operand 14094 states and 51368 transitions. Second operand has 85 states, 85 states have (on average 3.458823529411765) internal successors, (294), 85 states have internal predecessors, (294), 0 states have call successors, (0), 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-01-18 12:26:55,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:26:55,963 INFO L93 Difference]: Finished difference Result 29759 states and 107876 transitions. [2022-01-18 12:26:55,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-01-18 12:26:55,964 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 3.458823529411765) internal successors, (294), 85 states have internal predecessors, (294), 0 states have call successors, (0), 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 124 [2022-01-18 12:26:55,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:26:56,043 INFO L225 Difference]: With dead ends: 29759 [2022-01-18 12:26:56,043 INFO L226 Difference]: Without dead ends: 29609 [2022-01-18 12:26:56,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 199 SyntacticMatches, 7 SemanticMatches, 130 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 4914 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=1504, Invalid=13769, Unknown=11, NotChecked=2008, Total=17292 [2022-01-18 12:26:56,046 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 1932 mSDsluCounter, 9243 mSDsCounter, 0 mSdLazyCounter, 3695 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1932 SdHoareTripleChecker+Valid, 8922 SdHoareTripleChecker+Invalid, 9166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5402 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-18 12:26:56,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1932 Valid, 8922 Invalid, 9166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3695 Invalid, 0 Unknown, 5402 Unchecked, 1.5s Time] [2022-01-18 12:26:56,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29609 states. [2022-01-18 12:26:56,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29609 to 14606. [2022-01-18 12:26:56,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14606 states, 14605 states have (on average 3.6661417322834646) internal successors, (53544), 14605 states have internal predecessors, (53544), 0 states have call successors, (0), 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-01-18 12:26:56,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14606 states to 14606 states and 53544 transitions. [2022-01-18 12:26:56,411 INFO L78 Accepts]: Start accepts. Automaton has 14606 states and 53544 transitions. Word has length 124 [2022-01-18 12:26:56,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:26:56,411 INFO L470 AbstractCegarLoop]: Abstraction has 14606 states and 53544 transitions. [2022-01-18 12:26:56,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 3.458823529411765) internal successors, (294), 85 states have internal predecessors, (294), 0 states have call successors, (0), 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-01-18 12:26:56,412 INFO L276 IsEmpty]: Start isEmpty. Operand 14606 states and 53544 transitions. [2022-01-18 12:26:56,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:26:56,438 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:26:56,438 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] [2022-01-18 12:26:56,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-01-18 12:26:56,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-01-18 12:26:56,639 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:26:56,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:26:56,639 INFO L85 PathProgramCache]: Analyzing trace with hash 727737786, now seen corresponding path program 11 times [2022-01-18 12:26:56,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:26:56,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484664845] [2022-01-18 12:26:56,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:26:56,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:26:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:26:57,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:26:57,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:26:57,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484664845] [2022-01-18 12:26:57,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484664845] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:26:57,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576412968] [2022-01-18 12:26:57,450 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 12:26:57,450 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:26:57,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:26:57,451 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:26:57,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-01-18 12:26:57,553 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 12:26:57,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:26:57,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 84 conjunts are in the unsatisfiable core [2022-01-18 12:26:57,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:26:58,221 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 15 treesize of output 11 [2022-01-18 12:26:58,754 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-01-18 12:26:59,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:26:59,047 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 18 treesize of output 20 [2022-01-18 12:26:59,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:26:59,171 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 18 treesize of output 20 [2022-01-18 12:26:59,349 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:26:59,350 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 21 treesize of output 21 [2022-01-18 12:26:59,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:26:59,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:27:00,085 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-01-18 12:27:00,148 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (not (< ~M~0 c_~N~0)))) is different from false [2022-01-18 12:27:00,202 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)))) is different from false [2022-01-18 12:27:00,217 WARN L838 $PredicateComparison]: unable to prove that (or (not (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0))))) is different from false [2022-01-18 12:27:00,232 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)))) (not (< 0 c_~N~0))) is different from false [2022-01-18 12:27:00,262 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int) (v_ArrVal_841 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_841))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ c_~res1~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset))))))) is different from false [2022-01-18 12:27:00,400 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int) (v_ArrVal_841 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_841))) (= (+ (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))))))) is different from false [2022-01-18 12:27:00,430 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int) (v_ArrVal_841 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_841))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res1~0)))))) is different from false [2022-01-18 12:27:00,447 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int) (v_ArrVal_841 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_841))) (= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) |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|))))) (not (< ~M~0 c_~N~0)))) (not (< 0 c_~N~0))) is different from false [2022-01-18 12:27:00,713 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:27:00,714 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 55 treesize of output 44 [2022-01-18 12:27:00,725 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:27:00,726 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 1670 treesize of output 1490 [2022-01-18 12:27:00,734 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 1478 treesize of output 1382 [2022-01-18 12:27:00,741 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 1382 treesize of output 1190 [2022-01-18 12:27:00,755 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:27:00,756 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 1190 treesize of output 1090 [2022-01-18 12:27:02,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-18 12:27:02,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576412968] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:27:02,202 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:27:02,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 84 [2022-01-18 12:27:02,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799564571] [2022-01-18 12:27:02,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:27:02,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-01-18 12:27:02,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:27:02,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-01-18 12:27:02,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=5056, Unknown=11, NotChecked=1386, Total=6972 [2022-01-18 12:27:02,204 INFO L87 Difference]: Start difference. First operand 14606 states and 53544 transitions. Second operand has 84 states, 84 states have (on average 3.5952380952380953) internal successors, (302), 84 states have internal predecessors, (302), 0 states have call successors, (0), 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-01-18 12:27:10,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:27:10,508 INFO L93 Difference]: Finished difference Result 34843 states and 126620 transitions. [2022-01-18 12:27:10,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-01-18 12:27:10,508 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 3.5952380952380953) internal successors, (302), 84 states have internal predecessors, (302), 0 states have call successors, (0), 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 124 [2022-01-18 12:27:10,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:27:10,599 INFO L225 Difference]: With dead ends: 34843 [2022-01-18 12:27:10,599 INFO L226 Difference]: Without dead ends: 34693 [2022-01-18 12:27:10,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 197 SyntacticMatches, 6 SemanticMatches, 136 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 5269 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1574, Invalid=14963, Unknown=11, NotChecked=2358, Total=18906 [2022-01-18 12:27:10,600 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 1979 mSDsluCounter, 8524 mSDsCounter, 0 mSdLazyCounter, 4307 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1979 SdHoareTripleChecker+Valid, 8159 SdHoareTripleChecker+Invalid, 8240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 4307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3801 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-18 12:27:10,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1979 Valid, 8159 Invalid, 8240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 4307 Invalid, 0 Unknown, 3801 Unchecked, 1.8s Time] [2022-01-18 12:27:10,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34693 states. [2022-01-18 12:27:10,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34693 to 14314. [2022-01-18 12:27:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14314 states, 14313 states have (on average 3.6482218961782995) internal successors, (52217), 14313 states have internal predecessors, (52217), 0 states have call successors, (0), 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-01-18 12:27:10,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14314 states to 14314 states and 52217 transitions. [2022-01-18 12:27:10,997 INFO L78 Accepts]: Start accepts. Automaton has 14314 states and 52217 transitions. Word has length 124 [2022-01-18 12:27:10,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:27:10,997 INFO L470 AbstractCegarLoop]: Abstraction has 14314 states and 52217 transitions. [2022-01-18 12:27:10,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 3.5952380952380953) internal successors, (302), 84 states have internal predecessors, (302), 0 states have call successors, (0), 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-01-18 12:27:10,997 INFO L276 IsEmpty]: Start isEmpty. Operand 14314 states and 52217 transitions. [2022-01-18 12:27:11,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:27:11,022 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:27:11,022 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] [2022-01-18 12:27:11,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-01-18 12:27:11,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-01-18 12:27:11,223 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:27:11,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:27:11,223 INFO L85 PathProgramCache]: Analyzing trace with hash 929729368, now seen corresponding path program 12 times [2022-01-18 12:27:11,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:27:11,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988552287] [2022-01-18 12:27:11,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:27:11,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:27:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:27:12,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:27:12,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:27:12,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988552287] [2022-01-18 12:27:12,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988552287] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:27:12,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890816697] [2022-01-18 12:27:12,032 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 12:27:12,032 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:27:12,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:27:12,033 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:27:12,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-01-18 12:27:12,137 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-01-18 12:27:12,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:27:12,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 72 conjunts are in the unsatisfiable core [2022-01-18 12:27:12,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:27:12,196 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-01-18 12:27:12,231 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 12:27:12,231 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-01-18 12:27:12,438 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-01-18 12:27:12,439 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-01-18 12:27:12,965 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 18 treesize of output 20 [2022-01-18 12:27:13,040 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 18 treesize of output 20 [2022-01-18 12:27:13,235 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:27:13,235 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 27 treesize of output 27 [2022-01-18 12:27:13,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:27:13,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:27:13,847 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_879 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_71| Int)) (or (<= (+ 2 |v_thread3Thread1of1ForFork2_~i~2#1_71|) c_~N~0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_71|) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_879) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_71| 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-01-18 12:27:13,905 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_879 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_71| Int)) (or (<= (+ 2 |v_thread3Thread1of1ForFork2_~i~2#1_71|) c_~N~0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_71|) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_878) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_879) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_71| 4))))))) is different from false [2022-01-18 12:27:13,954 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:27:13,955 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 242 treesize of output 178 [2022-01-18 12:27:13,958 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 162 treesize of output 150 [2022-01-18 12:27:13,961 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 150 treesize of output 126 [2022-01-18 12:27:14,923 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-01-18 12:27:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:27:14,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890816697] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:27:14,945 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:27:14,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 68 [2022-01-18 12:27:14,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766185493] [2022-01-18 12:27:14,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:27:14,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-01-18 12:27:14,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:27:14,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-01-18 12:27:14,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=3889, Unknown=2, NotChecked=258, Total=4556 [2022-01-18 12:27:14,947 INFO L87 Difference]: Start difference. First operand 14314 states and 52217 transitions. Second operand has 68 states, 68 states have (on average 4.5) internal successors, (306), 68 states have internal predecessors, (306), 0 states have call successors, (0), 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-01-18 12:27:24,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:27:24,157 INFO L93 Difference]: Finished difference Result 34356 states and 125418 transitions. [2022-01-18 12:27:24,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-01-18 12:27:24,157 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 4.5) internal successors, (306), 68 states have internal predecessors, (306), 0 states have call successors, (0), 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 124 [2022-01-18 12:27:24,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:27:24,248 INFO L225 Difference]: With dead ends: 34356 [2022-01-18 12:27:24,249 INFO L226 Difference]: Without dead ends: 34347 [2022-01-18 12:27:24,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 221 SyntacticMatches, 12 SemanticMatches, 159 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 7929 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=3779, Invalid=21349, Unknown=2, NotChecked=630, Total=25760 [2022-01-18 12:27:24,252 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 2572 mSDsluCounter, 9887 mSDsCounter, 0 mSdLazyCounter, 4111 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2572 SdHoareTripleChecker+Valid, 9666 SdHoareTripleChecker+Invalid, 8060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 4111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3890 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-18 12:27:24,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2572 Valid, 9666 Invalid, 8060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 4111 Invalid, 0 Unknown, 3890 Unchecked, 1.9s Time] [2022-01-18 12:27:24,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34347 states. [2022-01-18 12:27:24,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34347 to 15582. [2022-01-18 12:27:24,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15582 states, 15581 states have (on average 3.662345163981773) internal successors, (57063), 15581 states have internal predecessors, (57063), 0 states have call successors, (0), 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-01-18 12:27:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15582 states to 15582 states and 57063 transitions. [2022-01-18 12:27:24,656 INFO L78 Accepts]: Start accepts. Automaton has 15582 states and 57063 transitions. Word has length 124 [2022-01-18 12:27:24,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:27:24,657 INFO L470 AbstractCegarLoop]: Abstraction has 15582 states and 57063 transitions. [2022-01-18 12:27:24,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 4.5) internal successors, (306), 68 states have internal predecessors, (306), 0 states have call successors, (0), 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-01-18 12:27:24,657 INFO L276 IsEmpty]: Start isEmpty. Operand 15582 states and 57063 transitions. [2022-01-18 12:27:24,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:27:24,684 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:27:24,684 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] [2022-01-18 12:27:24,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-01-18 12:27:24,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:27:24,884 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:27:24,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:27:24,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1843297594, now seen corresponding path program 13 times [2022-01-18 12:27:24,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:27:24,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033703090] [2022-01-18 12:27:24,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:27:24,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:27:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:27:25,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:27:25,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:27:25,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033703090] [2022-01-18 12:27:25,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033703090] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:27:25,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827392282] [2022-01-18 12:27:25,709 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-18 12:27:25,709 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:27:25,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:27:25,710 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:27:25,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-01-18 12:27:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:27:25,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 84 conjunts are in the unsatisfiable core [2022-01-18 12:27:25,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:27:25,882 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-01-18 12:27:25,924 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 12:27:25,924 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-01-18 12:27:26,364 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-01-18 12:27:26,365 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-01-18 12:27:26,576 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-01-18 12:27:27,054 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-01-18 12:27:27,265 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 18 treesize of output 20 [2022-01-18 12:27:27,359 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 18 treesize of output 20 [2022-01-18 12:27:27,547 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:27:27,547 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 27 treesize of output 27 [2022-01-18 12:27:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:27:27,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:27:28,190 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_918 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_918) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) is different from false [2022-01-18 12:27:28,246 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_918 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_917) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_918) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-01-18 12:27:28,297 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_918 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_917) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_918) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)))) is different from false [2022-01-18 12:27:28,319 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_918 (Array Int Int))) (or (= (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0) (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_917) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_918) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))) is different from false [2022-01-18 12:27:28,343 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int)) (v_ArrVal_918 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_916))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_917) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_918) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ c_~res1~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset)))) (not (< ~M~0 c_~N~0)))) is different from false [2022-01-18 12:27:28,453 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int)) (v_ArrVal_918 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_916))) (= (+ (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_917) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_918) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))))))) is different from false [2022-01-18 12:27:28,478 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int)) (v_ArrVal_918 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_916))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_917) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_918) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (not (< ~M~0 c_~N~0)))) is different from false [2022-01-18 12:27:28,492 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int)) (v_ArrVal_918 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_916))) (= (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_917) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_918) |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_~res2~0))))) is different from false [2022-01-18 12:27:28,720 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:27:28,720 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 55 treesize of output 44 [2022-01-18 12:27:28,729 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:27:28,729 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 3350 treesize of output 2978 [2022-01-18 12:27:28,739 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 2966 treesize of output 2774 [2022-01-18 12:27:28,750 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 2774 treesize of output 2390 [2022-01-18 12:27:28,766 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:27:28,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 2390 treesize of output 2178 [2022-01-18 12:28:00,832 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-01-18 12:28:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-18 12:28:00,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827392282] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:28:00,854 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:28:00,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 81 [2022-01-18 12:28:00,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573925953] [2022-01-18 12:28:00,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:28:00,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-01-18 12:28:00,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:28:00,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-01-18 12:28:00,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=4785, Unknown=11, NotChecked=1192, Total=6480 [2022-01-18 12:28:00,856 INFO L87 Difference]: Start difference. First operand 15582 states and 57063 transitions. Second operand has 81 states, 81 states have (on average 3.7777777777777777) internal successors, (306), 81 states have internal predecessors, (306), 0 states have call successors, (0), 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-01-18 12:28:05,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:28:05,869 INFO L93 Difference]: Finished difference Result 32775 states and 118600 transitions. [2022-01-18 12:28:05,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-01-18 12:28:05,870 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 3.7777777777777777) internal successors, (306), 81 states have internal predecessors, (306), 0 states have call successors, (0), 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 124 [2022-01-18 12:28:05,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:28:05,963 INFO L225 Difference]: With dead ends: 32775 [2022-01-18 12:28:05,963 INFO L226 Difference]: Without dead ends: 32475 [2022-01-18 12:28:05,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 205 SyntacticMatches, 8 SemanticMatches, 127 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 4676 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1459, Invalid=13082, Unknown=11, NotChecked=1960, Total=16512 [2022-01-18 12:28:05,965 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 1584 mSDsluCounter, 9207 mSDsCounter, 0 mSdLazyCounter, 2936 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1584 SdHoareTripleChecker+Valid, 8871 SdHoareTripleChecker+Invalid, 9180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6201 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-18 12:28:05,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1584 Valid, 8871 Invalid, 9180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2936 Invalid, 0 Unknown, 6201 Unchecked, 1.3s Time] [2022-01-18 12:28:06,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32475 states. [2022-01-18 12:28:06,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32475 to 15001. [2022-01-18 12:28:06,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15001 states, 15000 states have (on average 3.6474) internal successors, (54711), 15000 states have internal predecessors, (54711), 0 states have call successors, (0), 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-01-18 12:28:06,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15001 states to 15001 states and 54711 transitions. [2022-01-18 12:28:06,378 INFO L78 Accepts]: Start accepts. Automaton has 15001 states and 54711 transitions. Word has length 124 [2022-01-18 12:28:06,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:28:06,379 INFO L470 AbstractCegarLoop]: Abstraction has 15001 states and 54711 transitions. [2022-01-18 12:28:06,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 3.7777777777777777) internal successors, (306), 81 states have internal predecessors, (306), 0 states have call successors, (0), 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-01-18 12:28:06,379 INFO L276 IsEmpty]: Start isEmpty. Operand 15001 states and 54711 transitions. [2022-01-18 12:28:06,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:28:06,406 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:28:06,406 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] [2022-01-18 12:28:06,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-01-18 12:28:06,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-01-18 12:28:06,606 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:28:06,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:28:06,607 INFO L85 PathProgramCache]: Analyzing trace with hash -673379146, now seen corresponding path program 14 times [2022-01-18 12:28:06,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:28:06,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846323534] [2022-01-18 12:28:06,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:28:06,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:28:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:28:07,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:28:07,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:28:07,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846323534] [2022-01-18 12:28:07,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846323534] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:28:07,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39343552] [2022-01-18 12:28:07,398 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 12:28:07,398 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:28:07,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:28:07,399 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:28:07,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-01-18 12:28:07,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 12:28:07,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:28:07,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 71 conjunts are in the unsatisfiable core [2022-01-18 12:28:07,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:28:07,584 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-01-18 12:28:07,794 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 12:28:07,795 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-01-18 12:28:08,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:28:08,296 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 18 treesize of output 20 [2022-01-18 12:28:08,375 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 18 treesize of output 20 [2022-01-18 12:28:08,582 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:28:08,582 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 27 treesize of output 27 [2022-01-18 12:28:08,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:28:08,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:28:09,228 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_953 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_77| Int)) (or (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_77|) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_953) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_77| 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (<= (+ 2 |v_thread3Thread1of1ForFork2_~i~2#1_77|) c_~N~0))) is different from false [2022-01-18 12:28:09,289 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_952 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_77| Int)) (or (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_77|) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_953) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_77| 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (<= (+ 2 |v_thread3Thread1of1ForFork2_~i~2#1_77|) c_~N~0))) is different from false [2022-01-18 12:28:09,338 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:28:09,339 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 116 treesize of output 92 [2022-01-18 12:28:09,341 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 76 treesize of output 64 [2022-01-18 12:28:09,347 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 34 treesize of output 28 [2022-01-18 12:28:10,433 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-01-18 12:28:10,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:28:10,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39343552] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:28:10,495 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:28:10,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 67 [2022-01-18 12:28:10,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536283528] [2022-01-18 12:28:10,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:28:10,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-01-18 12:28:10,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:28:10,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-01-18 12:28:10,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=3772, Unknown=2, NotChecked=254, Total=4422 [2022-01-18 12:28:10,496 INFO L87 Difference]: Start difference. First operand 15001 states and 54711 transitions. Second operand has 67 states, 67 states have (on average 4.552238805970149) internal successors, (305), 67 states have internal predecessors, (305), 0 states have call successors, (0), 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-01-18 12:28:21,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:28:21,474 INFO L93 Difference]: Finished difference Result 33145 states and 121092 transitions. [2022-01-18 12:28:21,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-01-18 12:28:21,474 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 4.552238805970149) internal successors, (305), 67 states have internal predecessors, (305), 0 states have call successors, (0), 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 124 [2022-01-18 12:28:21,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:28:21,575 INFO L225 Difference]: With dead ends: 33145 [2022-01-18 12:28:21,575 INFO L226 Difference]: Without dead ends: 33130 [2022-01-18 12:28:21,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 213 SyntacticMatches, 16 SemanticMatches, 156 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 7416 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=3518, Invalid=20668, Unknown=2, NotChecked=618, Total=24806 [2022-01-18 12:28:21,578 INFO L933 BasicCegarLoop]: 365 mSDtfsCounter, 2313 mSDsluCounter, 11725 mSDsCounter, 0 mSdLazyCounter, 5658 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2313 SdHoareTripleChecker+Valid, 11362 SdHoareTripleChecker+Invalid, 8825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 5658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3117 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-18 12:28:21,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2313 Valid, 11362 Invalid, 8825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 5658 Invalid, 0 Unknown, 3117 Unchecked, 2.6s Time] [2022-01-18 12:28:21,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33130 states. [2022-01-18 12:28:21,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33130 to 14998. [2022-01-18 12:28:21,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14998 states, 14997 states have (on average 3.6475961859038475) internal successors, (54703), 14997 states have internal predecessors, (54703), 0 states have call successors, (0), 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-01-18 12:28:22,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14998 states to 14998 states and 54703 transitions. [2022-01-18 12:28:22,025 INFO L78 Accepts]: Start accepts. Automaton has 14998 states and 54703 transitions. Word has length 124 [2022-01-18 12:28:22,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:28:22,025 INFO L470 AbstractCegarLoop]: Abstraction has 14998 states and 54703 transitions. [2022-01-18 12:28:22,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 4.552238805970149) internal successors, (305), 67 states have internal predecessors, (305), 0 states have call successors, (0), 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-01-18 12:28:22,025 INFO L276 IsEmpty]: Start isEmpty. Operand 14998 states and 54703 transitions. [2022-01-18 12:28:22,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:28:22,055 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:28:22,055 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] [2022-01-18 12:28:22,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-01-18 12:28:22,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:28:22,256 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:28:22,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:28:22,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1592604130, now seen corresponding path program 15 times [2022-01-18 12:28:22,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:28:22,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252186672] [2022-01-18 12:28:22,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:28:22,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:28:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:28:23,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:28:23,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:28:23,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252186672] [2022-01-18 12:28:23,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252186672] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:28:23,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073838406] [2022-01-18 12:28:23,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 12:28:23,143 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:28:23,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:28:23,144 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:28:23,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-01-18 12:28:23,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 12:28:23,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:28:23,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 79 conjunts are in the unsatisfiable core [2022-01-18 12:28:23,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:28:23,357 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-01-18 12:28:23,623 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 12:28:23,624 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-01-18 12:28:23,803 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-01-18 12:28:24,137 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-01-18 12:28:24,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:28:24,397 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 18 treesize of output 20 [2022-01-18 12:28:24,493 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 18 treesize of output 20 [2022-01-18 12:28:24,746 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:28:24,747 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 21 treesize of output 21 [2022-01-18 12:28:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:28:25,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:28:25,419 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_991 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int)) (or (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (<= (+ 2 |v_thread3Thread1of1ForFork2_~i~2#1_80|) c_~N~0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|))) is different from false [2022-01-18 12:28:25,480 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_991 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int) (v_ArrVal_990 (Array Int Int))) (or (<= (+ 2 |v_thread3Thread1of1ForFork2_~i~2#1_80|) c_~N~0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-01-18 12:28:25,537 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_991 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int) (v_ArrVal_990 (Array Int Int))) (or (<= (+ 2 |v_thread3Thread1of1ForFork2_~i~2#1_80|) c_~N~0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)))) is different from false [2022-01-18 12:28:25,552 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_991 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int) (v_ArrVal_990 (Array Int Int))) (or (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) |c_thread1Thread1of1ForFork0_~i~0#1|) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)))) is different from false [2022-01-18 12:28:25,566 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_991 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int) (v_ArrVal_990 (Array Int Int))) (or (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) 0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|) (= (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0) (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4))))))) is different from false [2022-01-18 12:28:25,592 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_989 (Array Int Int)) (v_ArrVal_991 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int) (v_ArrVal_990 (Array Int Int))) (or (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) 0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_989))) (= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4)))))))) is different from false [2022-01-18 12:28:25,717 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_989 (Array Int Int)) (v_ArrVal_991 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int) (v_ArrVal_990 (Array Int Int))) (or (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) 0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_989))) (= (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4)))))) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|))) is different from false [2022-01-18 12:28:25,745 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_989 (Array Int Int)) (v_ArrVal_991 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int) (v_ArrVal_990 (Array Int Int))) (or (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) 0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_989))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|))) is different from false [2022-01-18 12:28:25,760 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_989 (Array Int Int)) (v_ArrVal_991 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int) (v_ArrVal_990 (Array Int Int))) (or (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) 0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_989))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res2~0) (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0))) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|))) is different from false [2022-01-18 12:28:25,828 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:28:25,829 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 44 [2022-01-18 12:28:25,837 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-01-18 12:28:25,838 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 1670 treesize of output 1482 [2022-01-18 12:28:25,847 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 1478 treesize of output 1286 [2022-01-18 12:28:25,859 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-01-18 12:28:25,860 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 1286 treesize of output 1178 [2022-01-18 12:28:25,869 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 1174 treesize of output 1078 [2022-01-18 12:29:48,543 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-01-18 12:29:48,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-18 12:29:48,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073838406] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:29:48,604 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:29:48,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 28] total 73 [2022-01-18 12:29:48,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821761063] [2022-01-18 12:29:48,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:29:48,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-01-18 12:29:48,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:29:48,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-01-18 12:29:48,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=3647, Unknown=9, NotChecked=1188, Total=5256 [2022-01-18 12:29:48,606 INFO L87 Difference]: Start difference. First operand 14998 states and 54703 transitions. Second operand has 73 states, 73 states have (on average 4.205479452054795) internal successors, (307), 73 states have internal predecessors, (307), 0 states have call successors, (0), 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-01-18 12:29:58,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:29:58,019 INFO L93 Difference]: Finished difference Result 48904 states and 177911 transitions. [2022-01-18 12:29:58,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2022-01-18 12:29:58,019 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 4.205479452054795) internal successors, (307), 73 states have internal predecessors, (307), 0 states have call successors, (0), 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 124 [2022-01-18 12:29:58,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:29:58,159 INFO L225 Difference]: With dead ends: 48904 [2022-01-18 12:29:58,159 INFO L226 Difference]: Without dead ends: 48754 [2022-01-18 12:29:58,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 211 SyntacticMatches, 8 SemanticMatches, 186 ConstructedPredicates, 9 IntricatePredicates, 2 DeprecatedPredicates, 12282 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=3025, Invalid=28864, Unknown=9, NotChecked=3258, Total=35156 [2022-01-18 12:29:58,163 INFO L933 BasicCegarLoop]: 365 mSDtfsCounter, 2340 mSDsluCounter, 11278 mSDsCounter, 0 mSdLazyCounter, 7571 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2340 SdHoareTripleChecker+Valid, 10568 SdHoareTripleChecker+Invalid, 14567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 7571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6877 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-01-18 12:29:58,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2340 Valid, 10568 Invalid, 14567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 7571 Invalid, 0 Unknown, 6877 Unchecked, 3.4s Time] [2022-01-18 12:29:58,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48754 states. [2022-01-18 12:29:58,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48754 to 13945. [2022-01-18 12:29:58,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13945 states, 13944 states have (on average 3.6399885255306943) internal successors, (50756), 13944 states have internal predecessors, (50756), 0 states have call successors, (0), 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-01-18 12:29:58,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13945 states to 13945 states and 50756 transitions. [2022-01-18 12:29:58,700 INFO L78 Accepts]: Start accepts. Automaton has 13945 states and 50756 transitions. Word has length 124 [2022-01-18 12:29:58,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:29:58,700 INFO L470 AbstractCegarLoop]: Abstraction has 13945 states and 50756 transitions. [2022-01-18 12:29:58,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 4.205479452054795) internal successors, (307), 73 states have internal predecessors, (307), 0 states have call successors, (0), 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-01-18 12:29:58,700 INFO L276 IsEmpty]: Start isEmpty. Operand 13945 states and 50756 transitions. [2022-01-18 12:29:58,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:29:58,726 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:29:58,726 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] [2022-01-18 12:29:58,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-01-18 12:29:58,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-01-18 12:29:58,927 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:29:58,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:29:58,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1814647960, now seen corresponding path program 5 times [2022-01-18 12:29:58,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:29:58,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321069030] [2022-01-18 12:29:58,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:29:58,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:29:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:29:59,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:29:59,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:29:59,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321069030] [2022-01-18 12:29:59,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321069030] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:29:59,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450581652] [2022-01-18 12:29:59,204 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 12:29:59,204 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:29:59,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:29:59,206 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:29:59,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-01-18 12:29:59,313 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 12:29:59,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:29:59,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 69 conjunts are in the unsatisfiable core [2022-01-18 12:29:59,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:29:59,826 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-18 12:30:00,157 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-01-18 12:30:00,309 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-01-18 12:30:00,402 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-01-18 12:30:00,550 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-01-18 12:30:00,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:30:00,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:30:00,767 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1028 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1028) c_~A~0.base))) (+ (* (- 1) (select .cse0 c_~A~0.offset)) (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0 (* (- 1) c_~res2~0))) 0)) is different from false [2022-01-18 12:30:00,787 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1028 (Array Int Int)) (v_ArrVal_1027 (Array Int Int))) (= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1027) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1028) c_~A~0.base))) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0 (* (- 1) (select .cse0 c_~A~0.offset)) (* (- 1) c_~res2~0))) 0)) is different from false [2022-01-18 12:30:00,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-01-18 12:30:00,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450581652] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:30:00,916 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:30:00,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24, 13] total 39 [2022-01-18 12:30:00,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977141571] [2022-01-18 12:30:00,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:30:00,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-01-18 12:30:00,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:30:00,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-01-18 12:30:00,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1161, Unknown=2, NotChecked=142, Total=1482 [2022-01-18 12:30:00,918 INFO L87 Difference]: Start difference. First operand 13945 states and 50756 transitions. Second operand has 39 states, 39 states have (on average 7.256410256410256) internal successors, (283), 39 states have internal predecessors, (283), 0 states have call successors, (0), 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-01-18 12:30:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:30:02,696 INFO L93 Difference]: Finished difference Result 25805 states and 94321 transitions. [2022-01-18 12:30:02,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-01-18 12:30:02,696 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 7.256410256410256) internal successors, (283), 39 states have internal predecessors, (283), 0 states have call successors, (0), 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 124 [2022-01-18 12:30:02,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:30:02,787 INFO L225 Difference]: With dead ends: 25805 [2022-01-18 12:30:02,787 INFO L226 Difference]: Without dead ends: 25655 [2022-01-18 12:30:02,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 227 SyntacticMatches, 9 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1283 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=576, Invalid=3590, Unknown=2, NotChecked=254, Total=4422 [2022-01-18 12:30:02,788 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 1124 mSDsluCounter, 4131 mSDsCounter, 0 mSdLazyCounter, 1677 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 4095 SdHoareTripleChecker+Invalid, 2258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 554 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-18 12:30:02,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1124 Valid, 4095 Invalid, 2258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1677 Invalid, 0 Unknown, 554 Unchecked, 0.8s Time] [2022-01-18 12:30:02,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25655 states. [2022-01-18 12:30:03,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25655 to 14379. [2022-01-18 12:30:03,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14379 states, 14378 states have (on average 3.642857142857143) internal successors, (52377), 14378 states have internal predecessors, (52377), 0 states have call successors, (0), 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-01-18 12:30:03,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14379 states to 14379 states and 52377 transitions. [2022-01-18 12:30:03,132 INFO L78 Accepts]: Start accepts. Automaton has 14379 states and 52377 transitions. Word has length 124 [2022-01-18 12:30:03,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:30:03,132 INFO L470 AbstractCegarLoop]: Abstraction has 14379 states and 52377 transitions. [2022-01-18 12:30:03,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.256410256410256) internal successors, (283), 39 states have internal predecessors, (283), 0 states have call successors, (0), 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-01-18 12:30:03,133 INFO L276 IsEmpty]: Start isEmpty. Operand 14379 states and 52377 transitions. [2022-01-18 12:30:03,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:30:03,159 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:30:03,159 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] [2022-01-18 12:30:03,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-01-18 12:30:03,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:30:03,360 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:30:03,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:30:03,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1340158932, now seen corresponding path program 6 times [2022-01-18 12:30:03,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:30:03,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605817499] [2022-01-18 12:30:03,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:30:03,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:30:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:30:03,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:30:03,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:30:03,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605817499] [2022-01-18 12:30:03,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605817499] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:30:03,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605847799] [2022-01-18 12:30:03,626 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 12:30:03,627 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:30:03,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:30:03,628 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:30:03,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-01-18 12:30:03,786 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-01-18 12:30:03,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:30:03,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 51 conjunts are in the unsatisfiable core [2022-01-18 12:30:03,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:30:04,256 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-01-18 12:30:04,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:30:04,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:30:04,418 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:30:04,418 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 27 treesize of output 28 [2022-01-18 12:30:04,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:30:04,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605847799] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:30:04,644 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:30:04,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 11] total 24 [2022-01-18 12:30:04,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529689537] [2022-01-18 12:30:04,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:30:04,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-18 12:30:04,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:30:04,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-18 12:30:04,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2022-01-18 12:30:04,645 INFO L87 Difference]: Start difference. First operand 14379 states and 52377 transitions. Second operand has 24 states, 24 states have (on average 8.958333333333334) internal successors, (215), 24 states have internal predecessors, (215), 0 states have call successors, (0), 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-01-18 12:30:05,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:30:05,630 INFO L93 Difference]: Finished difference Result 34527 states and 125047 transitions. [2022-01-18 12:30:05,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-01-18 12:30:05,630 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.958333333333334) internal successors, (215), 24 states have internal predecessors, (215), 0 states have call successors, (0), 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 124 [2022-01-18 12:30:05,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:30:05,728 INFO L225 Difference]: With dead ends: 34527 [2022-01-18 12:30:05,728 INFO L226 Difference]: Without dead ends: 34377 [2022-01-18 12:30:05,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 241 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=402, Invalid=2354, Unknown=0, NotChecked=0, Total=2756 [2022-01-18 12:30:05,729 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 1095 mSDsluCounter, 3291 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 3352 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-18 12:30:05,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1095 Valid, 3352 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-18 12:30:05,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34377 states. [2022-01-18 12:30:06,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34377 to 14583. [2022-01-18 12:30:06,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14583 states, 14582 states have (on average 3.643327389932794) internal successors, (53127), 14582 states have internal predecessors, (53127), 0 states have call successors, (0), 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-01-18 12:30:06,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14583 states to 14583 states and 53127 transitions. [2022-01-18 12:30:06,156 INFO L78 Accepts]: Start accepts. Automaton has 14583 states and 53127 transitions. Word has length 124 [2022-01-18 12:30:06,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:30:06,157 INFO L470 AbstractCegarLoop]: Abstraction has 14583 states and 53127 transitions. [2022-01-18 12:30:06,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.958333333333334) internal successors, (215), 24 states have internal predecessors, (215), 0 states have call successors, (0), 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-01-18 12:30:06,157 INFO L276 IsEmpty]: Start isEmpty. Operand 14583 states and 53127 transitions. [2022-01-18 12:30:06,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:30:06,184 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:30:06,184 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] [2022-01-18 12:30:06,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-01-18 12:30:06,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:30:06,384 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:30:06,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:30:06,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1904339992, now seen corresponding path program 7 times [2022-01-18 12:30:06,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:30:06,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238045888] [2022-01-18 12:30:06,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:30:06,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:30:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:30:06,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:30:06,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:30:06,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238045888] [2022-01-18 12:30:06,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238045888] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:30:06,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560263040] [2022-01-18 12:30:06,672 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-18 12:30:06,672 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:30:06,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:30:06,674 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:30:06,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-01-18 12:30:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:30:06,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-18 12:30:06,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:30:07,201 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-01-18 12:30:07,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:30:07,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:30:07,345 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:30:07,345 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 27 treesize of output 28 [2022-01-18 12:30:07,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:30:07,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560263040] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:30:07,543 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:30:07,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 11] total 26 [2022-01-18 12:30:07,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646847914] [2022-01-18 12:30:07,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:30:07,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-18 12:30:07,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:30:07,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-18 12:30:07,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-01-18 12:30:07,544 INFO L87 Difference]: Start difference. First operand 14583 states and 53127 transitions. Second operand has 26 states, 26 states have (on average 10.115384615384615) internal successors, (263), 26 states have internal predecessors, (263), 0 states have call successors, (0), 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-01-18 12:30:08,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:30:08,383 INFO L93 Difference]: Finished difference Result 30539 states and 110704 transitions. [2022-01-18 12:30:08,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-18 12:30:08,383 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 10.115384615384615) internal successors, (263), 26 states have internal predecessors, (263), 0 states have call successors, (0), 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 124 [2022-01-18 12:30:08,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:30:08,465 INFO L225 Difference]: With dead ends: 30539 [2022-01-18 12:30:08,465 INFO L226 Difference]: Without dead ends: 30389 [2022-01-18 12:30:08,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 239 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=349, Invalid=1907, Unknown=0, NotChecked=0, Total=2256 [2022-01-18 12:30:08,466 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 813 mSDsluCounter, 3306 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 3378 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-18 12:30:08,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [813 Valid, 3378 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-18 12:30:08,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30389 states. [2022-01-18 12:30:08,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30389 to 14507. [2022-01-18 12:30:08,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14507 states, 14506 states have (on average 3.6431131945401902) internal successors, (52847), 14506 states have internal predecessors, (52847), 0 states have call successors, (0), 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-01-18 12:30:08,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14507 states to 14507 states and 52847 transitions. [2022-01-18 12:30:08,826 INFO L78 Accepts]: Start accepts. Automaton has 14507 states and 52847 transitions. Word has length 124 [2022-01-18 12:30:08,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:30:08,826 INFO L470 AbstractCegarLoop]: Abstraction has 14507 states and 52847 transitions. [2022-01-18 12:30:08,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.115384615384615) internal successors, (263), 26 states have internal predecessors, (263), 0 states have call successors, (0), 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-01-18 12:30:08,826 INFO L276 IsEmpty]: Start isEmpty. Operand 14507 states and 52847 transitions. [2022-01-18 12:30:08,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:30:08,851 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:30:08,851 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] [2022-01-18 12:30:08,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-01-18 12:30:09,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:30:09,052 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:30:09,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:30:09,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1045504418, now seen corresponding path program 8 times [2022-01-18 12:30:09,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:30:09,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866294198] [2022-01-18 12:30:09,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:30:09,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:30:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:30:09,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:30:09,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:30:09,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866294198] [2022-01-18 12:30:09,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866294198] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:30:09,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863432714] [2022-01-18 12:30:09,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 12:30:09,320 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:30:09,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:30:09,321 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:30:09,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-01-18 12:30:09,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 12:30:09,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:30:09,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 51 conjunts are in the unsatisfiable core [2022-01-18 12:30:09,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:30:09,870 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-01-18 12:30:09,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:30:09,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:30:10,017 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:30:10,017 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 27 treesize of output 28 [2022-01-18 12:30:10,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:30:10,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863432714] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:30:10,215 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:30:10,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 11] total 24 [2022-01-18 12:30:10,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981990858] [2022-01-18 12:30:10,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:30:10,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-18 12:30:10,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:30:10,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-18 12:30:10,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2022-01-18 12:30:10,216 INFO L87 Difference]: Start difference. First operand 14507 states and 52847 transitions. Second operand has 24 states, 24 states have (on average 8.958333333333334) internal successors, (215), 24 states have internal predecessors, (215), 0 states have call successors, (0), 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-01-18 12:30:11,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:30:11,175 INFO L93 Difference]: Finished difference Result 37419 states and 135757 transitions. [2022-01-18 12:30:11,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-01-18 12:30:11,175 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.958333333333334) internal successors, (215), 24 states have internal predecessors, (215), 0 states have call successors, (0), 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 124 [2022-01-18 12:30:11,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:30:11,281 INFO L225 Difference]: With dead ends: 37419 [2022-01-18 12:30:11,281 INFO L226 Difference]: Without dead ends: 37269 [2022-01-18 12:30:11,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 241 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=359, Invalid=2191, Unknown=0, NotChecked=0, Total=2550 [2022-01-18 12:30:11,282 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 1294 mSDsluCounter, 2941 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 3001 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-18 12:30:11,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1294 Valid, 3001 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-18 12:30:11,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37269 states. [2022-01-18 12:30:11,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37269 to 14589. [2022-01-18 12:30:11,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14589 states, 14588 states have (on average 3.6469015629284343) internal successors, (53201), 14588 states have internal predecessors, (53201), 0 states have call successors, (0), 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-01-18 12:30:11,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14589 states to 14589 states and 53201 transitions. [2022-01-18 12:30:11,702 INFO L78 Accepts]: Start accepts. Automaton has 14589 states and 53201 transitions. Word has length 124 [2022-01-18 12:30:11,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:30:11,703 INFO L470 AbstractCegarLoop]: Abstraction has 14589 states and 53201 transitions. [2022-01-18 12:30:11,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.958333333333334) internal successors, (215), 24 states have internal predecessors, (215), 0 states have call successors, (0), 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-01-18 12:30:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 14589 states and 53201 transitions. [2022-01-18 12:30:11,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:30:11,729 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:30:11,729 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] [2022-01-18 12:30:11,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-01-18 12:30:11,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-01-18 12:30:11,930 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:30:11,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:30:11,930 INFO L85 PathProgramCache]: Analyzing trace with hash -708025836, now seen corresponding path program 9 times [2022-01-18 12:30:11,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:30:11,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212104213] [2022-01-18 12:30:11,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:30:11,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:30:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:30:12,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:30:12,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:30:12,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212104213] [2022-01-18 12:30:12,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212104213] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:30:12,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995536860] [2022-01-18 12:30:12,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 12:30:12,272 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:30:12,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:30:12,276 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:30:12,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-01-18 12:30:12,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 12:30:12,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:30:12,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 51 conjunts are in the unsatisfiable core [2022-01-18 12:30:12,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:30:12,930 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-01-18 12:30:12,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:30:12,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:30:13,089 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:30:13,089 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 27 treesize of output 28 [2022-01-18 12:30:13,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:30:13,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995536860] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:30:13,301 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:30:13,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 11] total 25 [2022-01-18 12:30:13,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472195164] [2022-01-18 12:30:13,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:30:13,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-18 12:30:13,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:30:13,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-18 12:30:13,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2022-01-18 12:30:13,303 INFO L87 Difference]: Start difference. First operand 14589 states and 53201 transitions. Second operand has 25 states, 25 states have (on average 8.64) internal successors, (216), 25 states have internal predecessors, (216), 0 states have call successors, (0), 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-01-18 12:30:14,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:30:14,143 INFO L93 Difference]: Finished difference Result 29554 states and 107255 transitions. [2022-01-18 12:30:14,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-18 12:30:14,144 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.64) internal successors, (216), 25 states have internal predecessors, (216), 0 states have call successors, (0), 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 124 [2022-01-18 12:30:14,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:30:14,353 INFO L225 Difference]: With dead ends: 29554 [2022-01-18 12:30:14,353 INFO L226 Difference]: Without dead ends: 29404 [2022-01-18 12:30:14,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 239 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=258, Invalid=1548, Unknown=0, NotChecked=0, Total=1806 [2022-01-18 12:30:14,354 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 839 mSDsluCounter, 2983 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 3030 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-18 12:30:14,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [839 Valid, 3030 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-18 12:30:14,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29404 states. [2022-01-18 12:30:14,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29404 to 14601. [2022-01-18 12:30:14,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14601 states, 14600 states have (on average 3.6402739726027398) internal successors, (53148), 14600 states have internal predecessors, (53148), 0 states have call successors, (0), 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-01-18 12:30:14,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 53148 transitions. [2022-01-18 12:30:14,696 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 53148 transitions. Word has length 124 [2022-01-18 12:30:14,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:30:14,697 INFO L470 AbstractCegarLoop]: Abstraction has 14601 states and 53148 transitions. [2022-01-18 12:30:14,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.64) internal successors, (216), 25 states have internal predecessors, (216), 0 states have call successors, (0), 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-01-18 12:30:14,697 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 53148 transitions. [2022-01-18 12:30:14,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:30:14,723 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:30:14,723 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] [2022-01-18 12:30:14,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-01-18 12:30:14,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-01-18 12:30:14,924 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:30:14,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:30:14,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1308591088, now seen corresponding path program 16 times [2022-01-18 12:30:14,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:30:14,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984175697] [2022-01-18 12:30:14,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:30:14,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:30:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:30:15,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:30:15,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:30:15,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984175697] [2022-01-18 12:30:15,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984175697] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:30:15,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591172971] [2022-01-18 12:30:15,605 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 12:30:15,606 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:30:15,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:30:15,606 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:30:15,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-01-18 12:30:15,721 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 12:30:15,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:30:15,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-01-18 12:30:15,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:30:16,378 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 15 treesize of output 11 [2022-01-18 12:30:16,883 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-01-18 12:30:17,074 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-01-18 12:30:17,185 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-01-18 12:30:17,471 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:30:17,471 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 23 treesize of output 23 [2022-01-18 12:30:17,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:30:17,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:30:18,054 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1193 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1193) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))))) is different from false [2022-01-18 12:30:18,118 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (~M~0 Int) (v_ArrVal_1193 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1193) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))))))) is different from false [2022-01-18 12:30:18,187 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (~M~0 Int) (v_ArrVal_1193 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1193) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ c_~res1~0 (select .cse0 c_~A~0.offset)))))) is different from false [2022-01-18 12:30:18,213 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (~M~0 Int) (v_ArrVal_1193 (Array Int Int))) (or (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1193) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 c_~A~0.offset)) (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0))) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))) is different from false [2022-01-18 12:30:18,337 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (~M~0 Int) (v_ArrVal_1193 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1193) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (= (+ c_~res2~0 (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.offset|)))))) is different from false [2022-01-18 12:30:18,365 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (~M~0 Int) (v_ArrVal_1193 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1193) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (+ c_~res2~0 (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))) (not (< ~M~0 c_~N~0)))) is different from false [2022-01-18 12:30:18,381 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (~M~0 Int) (v_ArrVal_1193 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1193) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0) (+ (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res2~0))))) is different from false [2022-01-18 12:30:18,618 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:30:18,618 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 61 treesize of output 50 [2022-01-18 12:30:18,625 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:30:18,625 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 194 treesize of output 194 [2022-01-18 12:30:18,633 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:30:18,633 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 182 treesize of output 162 [2022-01-18 12:30:18,642 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:30:18,643 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 150 treesize of output 146 [2022-01-18 12:30:18,652 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:30:18,653 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 70 treesize of output 75 [2022-01-18 12:30:19,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-18 12:30:19,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591172971] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:30:19,591 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:30:19,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 29] total 74 [2022-01-18 12:30:19,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819440215] [2022-01-18 12:30:19,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:30:19,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-01-18 12:30:19,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:30:19,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-01-18 12:30:19,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=569, Invalid=3872, Unknown=9, NotChecked=952, Total=5402 [2022-01-18 12:30:19,593 INFO L87 Difference]: Start difference. First operand 14601 states and 53148 transitions. Second operand has 74 states, 74 states have (on average 4.081081081081081) internal successors, (302), 74 states have internal predecessors, (302), 0 states have call successors, (0), 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-01-18 12:30:25,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:30:25,157 INFO L93 Difference]: Finished difference Result 32738 states and 118481 transitions. [2022-01-18 12:30:25,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-01-18 12:30:25,157 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 4.081081081081081) internal successors, (302), 74 states have internal predecessors, (302), 0 states have call successors, (0), 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 124 [2022-01-18 12:30:25,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:30:25,251 INFO L225 Difference]: With dead ends: 32738 [2022-01-18 12:30:25,251 INFO L226 Difference]: Without dead ends: 32138 [2022-01-18 12:30:25,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 211 SyntacticMatches, 11 SemanticMatches, 126 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 5131 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1838, Invalid=12701, Unknown=9, NotChecked=1708, Total=16256 [2022-01-18 12:30:25,253 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 2716 mSDsluCounter, 7567 mSDsCounter, 0 mSdLazyCounter, 3087 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2716 SdHoareTripleChecker+Valid, 7234 SdHoareTripleChecker+Invalid, 7415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 3087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4282 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-18 12:30:25,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2716 Valid, 7234 Invalid, 7415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 3087 Invalid, 0 Unknown, 4282 Unchecked, 1.4s Time] [2022-01-18 12:30:25,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32138 states. [2022-01-18 12:30:25,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32138 to 15893. [2022-01-18 12:30:25,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15893 states, 15892 states have (on average 3.6546060911150264) internal successors, (58079), 15892 states have internal predecessors, (58079), 0 states have call successors, (0), 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-01-18 12:30:25,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15893 states to 15893 states and 58079 transitions. [2022-01-18 12:30:25,690 INFO L78 Accepts]: Start accepts. Automaton has 15893 states and 58079 transitions. Word has length 124 [2022-01-18 12:30:25,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:30:25,690 INFO L470 AbstractCegarLoop]: Abstraction has 15893 states and 58079 transitions. [2022-01-18 12:30:25,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 4.081081081081081) internal successors, (302), 74 states have internal predecessors, (302), 0 states have call successors, (0), 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-01-18 12:30:25,690 INFO L276 IsEmpty]: Start isEmpty. Operand 15893 states and 58079 transitions. [2022-01-18 12:30:25,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:30:25,719 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:30:25,719 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] [2022-01-18 12:30:25,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-01-18 12:30:25,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:30:25,920 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:30:25,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:30:25,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1704657420, now seen corresponding path program 17 times [2022-01-18 12:30:25,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:30:25,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301235954] [2022-01-18 12:30:25,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:30:25,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:30:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:30:26,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:30:26,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:30:26,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301235954] [2022-01-18 12:30:26,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301235954] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:30:26,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112921254] [2022-01-18 12:30:26,814 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 12:30:26,814 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:30:26,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:30:26,815 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:30:26,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-01-18 12:30:26,929 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 12:30:26,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:30:26,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 63 conjunts are in the unsatisfiable core [2022-01-18 12:30:26,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:30:28,138 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:30:28,139 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 17 treesize of output 17 [2022-01-18 12:30:28,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:30:28,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:30:28,690 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:30:28,691 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 23 treesize of output 24 [2022-01-18 12:30:29,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:30:29,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112921254] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:30:29,672 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:30:29,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 22] total 61 [2022-01-18 12:30:29,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436283765] [2022-01-18 12:30:29,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:30:29,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-01-18 12:30:29,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:30:29,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-01-18 12:30:29,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=3228, Unknown=0, NotChecked=0, Total=3660 [2022-01-18 12:30:29,674 INFO L87 Difference]: Start difference. First operand 15893 states and 58079 transitions. Second operand has 61 states, 61 states have (on average 4.983606557377049) internal successors, (304), 61 states have internal predecessors, (304), 0 states have call successors, (0), 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-01-18 12:30:40,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:30:40,472 INFO L93 Difference]: Finished difference Result 51103 states and 187785 transitions. [2022-01-18 12:30:40,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-01-18 12:30:40,472 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 4.983606557377049) internal successors, (304), 61 states have internal predecessors, (304), 0 states have call successors, (0), 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 124 [2022-01-18 12:30:40,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:30:40,622 INFO L225 Difference]: With dead ends: 51103 [2022-01-18 12:30:40,623 INFO L226 Difference]: Without dead ends: 50803 [2022-01-18 12:30:40,625 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 210 SyntacticMatches, 9 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9608 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=3107, Invalid=24283, Unknown=0, NotChecked=0, Total=27390 [2022-01-18 12:30:40,625 INFO L933 BasicCegarLoop]: 423 mSDtfsCounter, 3205 mSDsluCounter, 11717 mSDsCounter, 0 mSdLazyCounter, 6954 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3205 SdHoareTripleChecker+Valid, 11021 SdHoareTripleChecker+Invalid, 9434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 6954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2336 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-01-18 12:30:40,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3205 Valid, 11021 Invalid, 9434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 6954 Invalid, 0 Unknown, 2336 Unchecked, 3.3s Time] [2022-01-18 12:30:40,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50803 states. [2022-01-18 12:30:41,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50803 to 14983. [2022-01-18 12:30:41,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14983 states, 14982 states have (on average 3.658590308370044) internal successors, (54813), 14982 states have internal predecessors, (54813), 0 states have call successors, (0), 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-01-18 12:30:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14983 states to 14983 states and 54813 transitions. [2022-01-18 12:30:41,158 INFO L78 Accepts]: Start accepts. Automaton has 14983 states and 54813 transitions. Word has length 124 [2022-01-18 12:30:41,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:30:41,158 INFO L470 AbstractCegarLoop]: Abstraction has 14983 states and 54813 transitions. [2022-01-18 12:30:41,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 4.983606557377049) internal successors, (304), 61 states have internal predecessors, (304), 0 states have call successors, (0), 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-01-18 12:30:41,159 INFO L276 IsEmpty]: Start isEmpty. Operand 14983 states and 54813 transitions. [2022-01-18 12:30:41,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:30:41,185 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:30:41,185 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] [2022-01-18 12:30:41,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-01-18 12:30:41,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-01-18 12:30:41,386 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:30:41,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:30:41,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1336949438, now seen corresponding path program 18 times [2022-01-18 12:30:41,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:30:41,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520799422] [2022-01-18 12:30:41,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:30:41,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:30:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:30:41,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:30:41,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:30:41,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520799422] [2022-01-18 12:30:41,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520799422] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:30:41,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814261352] [2022-01-18 12:30:41,975 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 12:30:41,975 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:30:41,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:30:41,976 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:30:41,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-01-18 12:30:42,093 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-01-18 12:30:42,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:30:42,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 54 conjunts are in the unsatisfiable core [2022-01-18 12:30:42,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:30:42,552 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:30:42,552 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 27 treesize of output 27 [2022-01-18 12:30:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:30:42,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:30:43,286 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:30:43,287 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 23 treesize of output 24 [2022-01-18 12:30:43,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:30:43,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814261352] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:30:43,683 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:30:43,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18, 17] total 51 [2022-01-18 12:30:43,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669594245] [2022-01-18 12:30:43,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:30:43,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-01-18 12:30:43,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:30:43,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-01-18 12:30:43,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=2193, Unknown=0, NotChecked=0, Total=2550 [2022-01-18 12:30:43,685 INFO L87 Difference]: Start difference. First operand 14983 states and 54813 transitions. Second operand has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 0 states have call successors, (0), 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-01-18 12:31:10,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:31:10,092 INFO L93 Difference]: Finished difference Result 90743 states and 331982 transitions. [2022-01-18 12:31:10,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 456 states. [2022-01-18 12:31:10,092 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 0 states have call successors, (0), 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 124 [2022-01-18 12:31:10,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:31:10,682 INFO L225 Difference]: With dead ends: 90743 [2022-01-18 12:31:10,682 INFO L226 Difference]: Without dead ends: 90443 [2022-01-18 12:31:10,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 759 GetRequests, 255 SyntacticMatches, 20 SemanticMatches, 484 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 108895 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=20436, Invalid=215274, Unknown=0, NotChecked=0, Total=235710 [2022-01-18 12:31:10,689 INFO L933 BasicCegarLoop]: 645 mSDtfsCounter, 3875 mSDsluCounter, 16372 mSDsCounter, 0 mSdLazyCounter, 10179 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3875 SdHoareTripleChecker+Valid, 14950 SdHoareTripleChecker+Invalid, 19637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 10179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9065 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-01-18 12:31:10,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3875 Valid, 14950 Invalid, 19637 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [393 Valid, 10179 Invalid, 0 Unknown, 9065 Unchecked, 4.8s Time] [2022-01-18 12:31:10,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90443 states. [2022-01-18 12:31:11,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90443 to 17855. [2022-01-18 12:31:11,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17855 states, 17854 states have (on average 3.694130166909376) internal successors, (65955), 17854 states have internal predecessors, (65955), 0 states have call successors, (0), 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-01-18 12:31:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17855 states to 17855 states and 65955 transitions. [2022-01-18 12:31:11,545 INFO L78 Accepts]: Start accepts. Automaton has 17855 states and 65955 transitions. Word has length 124 [2022-01-18 12:31:11,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:31:11,545 INFO L470 AbstractCegarLoop]: Abstraction has 17855 states and 65955 transitions. [2022-01-18 12:31:11,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 0 states have call successors, (0), 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-01-18 12:31:11,545 INFO L276 IsEmpty]: Start isEmpty. Operand 17855 states and 65955 transitions. [2022-01-18 12:31:11,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:31:11,577 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:31:11,578 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] [2022-01-18 12:31:11,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-01-18 12:31:11,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-01-18 12:31:11,778 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:31:11,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:31:11,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1679196940, now seen corresponding path program 19 times [2022-01-18 12:31:11,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:31:11,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117831849] [2022-01-18 12:31:11,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:31:11,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:31:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:31:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:31:12,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:31:12,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117831849] [2022-01-18 12:31:12,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117831849] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:31:12,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260456046] [2022-01-18 12:31:12,554 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-18 12:31:12,554 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:31:12,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:31:12,555 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:31:12,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-01-18 12:31:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:31:12,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 82 conjunts are in the unsatisfiable core [2022-01-18 12:31:12,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:31:12,770 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-01-18 12:31:13,126 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 12:31:13,127 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-01-18 12:31:13,356 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-01-18 12:31:13,855 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-01-18 12:31:14,043 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-01-18 12:31:14,147 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-01-18 12:31:14,353 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:31:14,353 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 27 treesize of output 27 [2022-01-18 12:31:14,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:31:14,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:31:15,217 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1295 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1295) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0) (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0))))) is different from false [2022-01-18 12:31:15,281 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1295) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))))))) is different from false [2022-01-18 12:31:15,347 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1295) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select .cse0 c_~A~0.offset) c_~res1~0))))) is different from false [2022-01-18 12:31:15,371 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1293) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1295) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 c_~A~0.offset)) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))))) is different from false [2022-01-18 12:31:15,485 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1293) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1295) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (= (+ c_~res2~0 (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.offset|)))) (not (< ~M~0 c_~N~0)))) is different from false [2022-01-18 12:31:15,510 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1293) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1295) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (+ c_~res2~0 (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res1~0))))) is different from false [2022-01-18 12:31:15,524 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1293) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1294) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1295) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (+ c_~res2~0 (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0))))) is different from false [2022-01-18 12:31:15,779 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:31:15,779 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 61 treesize of output 50 [2022-01-18 12:31:15,789 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:31:15,789 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 3254 treesize of output 3074 [2022-01-18 12:31:15,806 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:31:15,806 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 3062 treesize of output 2562 [2022-01-18 12:31:15,824 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:31:15,824 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 2550 treesize of output 2434 [2022-01-18 12:31:15,842 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:31:15,842 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 2422 treesize of output 2178 [2022-01-18 12:31:28,981 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-01-18 12:31:29,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-18 12:31:29,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260456046] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:31:29,007 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:31:29,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 31] total 79 [2022-01-18 12:31:29,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765249158] [2022-01-18 12:31:29,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:31:29,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-01-18 12:31:29,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:31:29,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-01-18 12:31:29,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=4629, Unknown=9, NotChecked=1022, Total=6162 [2022-01-18 12:31:29,009 INFO L87 Difference]: Start difference. First operand 17855 states and 65955 transitions. Second operand has 79 states, 79 states have (on average 4.012658227848101) internal successors, (317), 79 states have internal predecessors, (317), 0 states have call successors, (0), 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-01-18 12:31:48,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:31:48,434 INFO L93 Difference]: Finished difference Result 68810 states and 248981 transitions. [2022-01-18 12:31:48,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2022-01-18 12:31:48,435 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 4.012658227848101) internal successors, (317), 79 states have internal predecessors, (317), 0 states have call successors, (0), 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 124 [2022-01-18 12:31:48,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:31:48,680 INFO L225 Difference]: With dead ends: 68810 [2022-01-18 12:31:48,680 INFO L226 Difference]: Without dead ends: 67910 [2022-01-18 12:31:48,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 213 SyntacticMatches, 24 SemanticMatches, 249 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 25174 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=4694, Invalid=54617, Unknown=9, NotChecked=3430, Total=62750 [2022-01-18 12:31:48,685 INFO L933 BasicCegarLoop]: 392 mSDtfsCounter, 4491 mSDsluCounter, 15312 mSDsCounter, 0 mSdLazyCounter, 9415 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4491 SdHoareTripleChecker+Valid, 14193 SdHoareTripleChecker+Invalid, 22086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 9415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12442 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-01-18 12:31:48,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4491 Valid, 14193 Invalid, 22086 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [229 Valid, 9415 Invalid, 0 Unknown, 12442 Unchecked, 4.6s Time] [2022-01-18 12:31:48,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67910 states. [2022-01-18 12:31:49,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67910 to 16397. [2022-01-18 12:31:49,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16397 states, 16396 states have (on average 3.6880336667479874) internal successors, (60469), 16396 states have internal predecessors, (60469), 0 states have call successors, (0), 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-01-18 12:31:49,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16397 states to 16397 states and 60469 transitions. [2022-01-18 12:31:49,507 INFO L78 Accepts]: Start accepts. Automaton has 16397 states and 60469 transitions. Word has length 124 [2022-01-18 12:31:49,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:31:49,507 INFO L470 AbstractCegarLoop]: Abstraction has 16397 states and 60469 transitions. [2022-01-18 12:31:49,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 4.012658227848101) internal successors, (317), 79 states have internal predecessors, (317), 0 states have call successors, (0), 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-01-18 12:31:49,507 INFO L276 IsEmpty]: Start isEmpty. Operand 16397 states and 60469 transitions. [2022-01-18 12:31:49,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:31:49,540 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:31:49,540 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] [2022-01-18 12:31:49,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-01-18 12:31:49,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-01-18 12:31:49,741 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:31:49,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:31:49,741 INFO L85 PathProgramCache]: Analyzing trace with hash 677970192, now seen corresponding path program 20 times [2022-01-18 12:31:49,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:31:49,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322063710] [2022-01-18 12:31:49,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:31:49,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:31:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:31:50,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:31:50,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:31:50,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322063710] [2022-01-18 12:31:50,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322063710] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:31:50,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405527033] [2022-01-18 12:31:50,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 12:31:50,407 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:31:50,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:31:50,408 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:31:50,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-01-18 12:31:50,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 12:31:50,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:31:50,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 55 conjunts are in the unsatisfiable core [2022-01-18 12:31:50,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:31:51,025 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:31:51,025 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 27 treesize of output 27 [2022-01-18 12:31:51,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:31:51,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:31:51,716 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:31:51,716 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 23 treesize of output 24 [2022-01-18 12:31:52,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:31:52,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405527033] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:31:52,142 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:31:52,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18, 17] total 51 [2022-01-18 12:31:52,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152166296] [2022-01-18 12:31:52,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:31:52,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-01-18 12:31:52,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:31:52,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-01-18 12:31:52,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=2283, Unknown=0, NotChecked=0, Total=2550 [2022-01-18 12:31:52,143 INFO L87 Difference]: Start difference. First operand 16397 states and 60469 transitions. Second operand has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 0 states have call successors, (0), 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-01-18 12:32:20,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:32:20,612 INFO L93 Difference]: Finished difference Result 116207 states and 425045 transitions. [2022-01-18 12:32:20,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 461 states. [2022-01-18 12:32:20,613 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 0 states have call successors, (0), 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 124 [2022-01-18 12:32:20,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:32:21,078 INFO L225 Difference]: With dead ends: 116207 [2022-01-18 12:32:21,078 INFO L226 Difference]: Without dead ends: 115649 [2022-01-18 12:32:21,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 262 SyntacticMatches, 32 SemanticMatches, 486 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107252 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=17926, Invalid=219730, Unknown=0, NotChecked=0, Total=237656 [2022-01-18 12:32:21,088 INFO L933 BasicCegarLoop]: 726 mSDtfsCounter, 3625 mSDsluCounter, 20517 mSDsCounter, 0 mSdLazyCounter, 9186 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3625 SdHoareTripleChecker+Valid, 19002 SdHoareTripleChecker+Invalid, 31185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 9186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21666 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-01-18 12:32:21,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3625 Valid, 19002 Invalid, 31185 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [333 Valid, 9186 Invalid, 0 Unknown, 21666 Unchecked, 4.9s Time] [2022-01-18 12:32:21,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115649 states. [2022-01-18 12:32:22,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115649 to 16981. [2022-01-18 12:32:22,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16981 states, 16980 states have (on average 3.70547703180212) internal successors, (62919), 16980 states have internal predecessors, (62919), 0 states have call successors, (0), 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-01-18 12:32:23,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16981 states to 16981 states and 62919 transitions. [2022-01-18 12:32:23,058 INFO L78 Accepts]: Start accepts. Automaton has 16981 states and 62919 transitions. Word has length 124 [2022-01-18 12:32:23,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:32:23,058 INFO L470 AbstractCegarLoop]: Abstraction has 16981 states and 62919 transitions. [2022-01-18 12:32:23,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 0 states have call successors, (0), 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-01-18 12:32:23,058 INFO L276 IsEmpty]: Start isEmpty. Operand 16981 states and 62919 transitions. [2022-01-18 12:32:23,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:32:23,098 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:32:23,098 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] [2022-01-18 12:32:23,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-01-18 12:32:23,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:32:23,298 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:32:23,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:32:23,299 INFO L85 PathProgramCache]: Analyzing trace with hash 2092648740, now seen corresponding path program 21 times [2022-01-18 12:32:23,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:32:23,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231509841] [2022-01-18 12:32:23,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:32:23,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:32:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:32:23,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:32:23,914 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:32:23,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231509841] [2022-01-18 12:32:23,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231509841] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:32:23,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341104381] [2022-01-18 12:32:23,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 12:32:23,914 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:32:23,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:32:23,915 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:32:23,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-01-18 12:32:24,035 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 12:32:24,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:32:24,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 55 conjunts are in the unsatisfiable core [2022-01-18 12:32:24,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:32:24,624 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:32:24,625 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 27 treesize of output 27 [2022-01-18 12:32:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:32:24,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:32:25,337 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:32:25,338 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 23 treesize of output 24 [2022-01-18 12:32:25,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:32:25,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341104381] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:32:25,752 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:32:25,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 18, 17] total 49 [2022-01-18 12:32:25,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356129271] [2022-01-18 12:32:25,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:32:25,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-01-18 12:32:25,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:32:25,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-01-18 12:32:25,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=2097, Unknown=0, NotChecked=0, Total=2352 [2022-01-18 12:32:25,754 INFO L87 Difference]: Start difference. First operand 16981 states and 62919 transitions. Second operand has 49 states, 49 states have (on average 6.204081632653061) internal successors, (304), 49 states have internal predecessors, (304), 0 states have call successors, (0), 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-01-18 12:32:49,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:32:49,779 INFO L93 Difference]: Finished difference Result 93956 states and 341569 transitions. [2022-01-18 12:32:49,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 366 states. [2022-01-18 12:32:49,780 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 6.204081632653061) internal successors, (304), 49 states have internal predecessors, (304), 0 states have call successors, (0), 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 124 [2022-01-18 12:32:49,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:32:50,369 INFO L225 Difference]: With dead ends: 93956 [2022-01-18 12:32:50,369 INFO L226 Difference]: Without dead ends: 93371 [2022-01-18 12:32:50,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 243 SyntacticMatches, 6 SemanticMatches, 388 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67865 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=13311, Invalid=138399, Unknown=0, NotChecked=0, Total=151710 [2022-01-18 12:32:50,376 INFO L933 BasicCegarLoop]: 541 mSDtfsCounter, 3398 mSDsluCounter, 15353 mSDsCounter, 0 mSdLazyCounter, 8406 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3398 SdHoareTripleChecker+Valid, 14126 SdHoareTripleChecker+Invalid, 18378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 8406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9656 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-01-18 12:32:50,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3398 Valid, 14126 Invalid, 18378 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [316 Valid, 8406 Invalid, 0 Unknown, 9656 Unchecked, 4.4s Time] [2022-01-18 12:32:50,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93371 states. [2022-01-18 12:32:51,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93371 to 17001. [2022-01-18 12:32:51,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17001 states, 17000 states have (on average 3.7067058823529413) internal successors, (63014), 17000 states have internal predecessors, (63014), 0 states have call successors, (0), 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-01-18 12:32:51,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17001 states to 17001 states and 63014 transitions. [2022-01-18 12:32:51,601 INFO L78 Accepts]: Start accepts. Automaton has 17001 states and 63014 transitions. Word has length 124 [2022-01-18 12:32:51,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:32:51,602 INFO L470 AbstractCegarLoop]: Abstraction has 17001 states and 63014 transitions. [2022-01-18 12:32:51,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 6.204081632653061) internal successors, (304), 49 states have internal predecessors, (304), 0 states have call successors, (0), 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-01-18 12:32:51,602 INFO L276 IsEmpty]: Start isEmpty. Operand 17001 states and 63014 transitions. [2022-01-18 12:32:51,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:32:51,637 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:32:51,637 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] [2022-01-18 12:32:51,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-01-18 12:32:51,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:32:51,838 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:32:51,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:32:51,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1474847118, now seen corresponding path program 22 times [2022-01-18 12:32:51,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:32:51,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226249103] [2022-01-18 12:32:51,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:32:51,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:32:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:32:52,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-01-18 12:32:52,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:32:52,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226249103] [2022-01-18 12:32:52,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226249103] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:32:52,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493927495] [2022-01-18 12:32:52,568 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 12:32:52,568 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:32:52,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:32:52,569 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:32:52,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-01-18 12:32:52,691 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 12:32:52,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:32:52,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-01-18 12:32:52,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:32:53,372 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 15 treesize of output 11 [2022-01-18 12:32:53,910 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-01-18 12:32:54,118 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-01-18 12:32:54,315 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-01-18 12:32:54,497 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:32:54,498 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 27 treesize of output 27 [2022-01-18 12:32:54,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:32:54,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:32:55,182 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1396 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1396) c_~A~0.base))) (= (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 12:32:55,247 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1395) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1396) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 12:32:55,316 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1395) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1396) c_~A~0.base))) (= (+ (select .cse0 c_~A~0.offset) c_~res1~0) (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 12:32:55,341 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int)) (v_ArrVal_1394 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1394) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1395) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1396) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select .cse0 c_~A~0.offset) c_~res1~0))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 12:32:55,463 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int)) (v_ArrVal_1394 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1394) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1395) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1396) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (= (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (+ c_~res2~0 (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 12:32:55,490 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int)) (v_ArrVal_1394 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1394) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1395) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1396) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (+ (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~res2~0) (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 12:32:55,505 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int)) (v_ArrVal_1394 (Array Int Int))) (or (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1394) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1395) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1396) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0) (+ (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res2~0))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-01-18 12:32:55,766 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:32:55,766 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 61 treesize of output 50 [2022-01-18 12:32:55,774 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:32:55,775 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 398 treesize of output 386 [2022-01-18 12:32:55,784 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:32:55,785 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 374 treesize of output 322 [2022-01-18 12:32:55,795 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:32:55,795 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 310 treesize of output 290 [2022-01-18 12:32:55,808 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:32:55,808 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 146 treesize of output 143 [2022-01-18 12:32:56,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-18 12:32:56,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493927495] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:32:56,970 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:32:56,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 29] total 77 [2022-01-18 12:32:56,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754239911] [2022-01-18 12:32:56,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:32:56,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-01-18 12:32:56,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:32:56,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-01-18 12:32:56,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=4366, Unknown=9, NotChecked=994, Total=5852 [2022-01-18 12:32:56,972 INFO L87 Difference]: Start difference. First operand 17001 states and 63014 transitions. Second operand has 77 states, 77 states have (on average 3.8051948051948052) internal successors, (293), 77 states have internal predecessors, (293), 0 states have call successors, (0), 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-01-18 12:33:04,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:33:04,744 INFO L93 Difference]: Finished difference Result 37388 states and 136707 transitions. [2022-01-18 12:33:04,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-01-18 12:33:04,745 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 3.8051948051948052) internal successors, (293), 77 states have internal predecessors, (293), 0 states have call successors, (0), 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 124 [2022-01-18 12:33:04,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:33:04,866 INFO L225 Difference]: With dead ends: 37388 [2022-01-18 12:33:04,866 INFO L226 Difference]: Without dead ends: 37238 [2022-01-18 12:33:04,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 205 SyntacticMatches, 8 SemanticMatches, 122 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 4536 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1333, Invalid=12258, Unknown=9, NotChecked=1652, Total=15252 [2022-01-18 12:33:04,867 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 1694 mSDsluCounter, 10488 mSDsCounter, 0 mSdLazyCounter, 3515 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1694 SdHoareTripleChecker+Valid, 10041 SdHoareTripleChecker+Invalid, 7954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 3515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4384 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-18 12:33:04,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1694 Valid, 10041 Invalid, 7954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 3515 Invalid, 0 Unknown, 4384 Unchecked, 1.5s Time] [2022-01-18 12:33:04,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37238 states. [2022-01-18 12:33:05,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37238 to 17561. [2022-01-18 12:33:05,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17561 states, 17560 states have (on average 3.715603644646925) internal successors, (65246), 17560 states have internal predecessors, (65246), 0 states have call successors, (0), 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-01-18 12:33:05,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17561 states to 17561 states and 65246 transitions. [2022-01-18 12:33:05,376 INFO L78 Accepts]: Start accepts. Automaton has 17561 states and 65246 transitions. Word has length 124 [2022-01-18 12:33:05,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:33:05,376 INFO L470 AbstractCegarLoop]: Abstraction has 17561 states and 65246 transitions. [2022-01-18 12:33:05,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 3.8051948051948052) internal successors, (293), 77 states have internal predecessors, (293), 0 states have call successors, (0), 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-01-18 12:33:05,376 INFO L276 IsEmpty]: Start isEmpty. Operand 17561 states and 65246 transitions. [2022-01-18 12:33:05,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:33:05,412 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:33:05,413 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] [2022-01-18 12:33:05,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-01-18 12:33:05,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-01-18 12:33:05,613 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:33:05,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:33:05,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1421602086, now seen corresponding path program 23 times [2022-01-18 12:33:05,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:33:05,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810734993] [2022-01-18 12:33:05,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:33:05,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:33:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:33:06,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:33:06,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:33:06,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810734993] [2022-01-18 12:33:06,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810734993] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:33:06,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600783532] [2022-01-18 12:33:06,272 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 12:33:06,272 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:33:06,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:33:06,273 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:33:06,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-01-18 12:33:06,393 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-18 12:33:06,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:33:06,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-01-18 12:33:06,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:33:06,464 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-01-18 12:33:06,499 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 12:33:06,499 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-01-18 12:33:06,771 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-01-18 12:33:06,772 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-01-18 12:33:06,923 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-01-18 12:33:07,206 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-01-18 12:33:07,389 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-01-18 12:33:07,486 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-01-18 12:33:07,685 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:33:07,685 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 27 treesize of output 27 [2022-01-18 12:33:08,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:33:08,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:33:08,489 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1435 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1435) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0))))) is different from false [2022-01-18 12:33:08,558 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1435 (Array Int Int)) (v_ArrVal_1434 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1434) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1435) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))))) is different from false [2022-01-18 12:33:08,621 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1435 (Array Int Int)) (v_ArrVal_1434 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) |c_thread1Thread1of1ForFork0_~i~0#1|) (< 0 ~M~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1434) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1435) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))))) is different from false [2022-01-18 12:33:08,942 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-01-18 12:33:08,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-01-18 12:33:08,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600783532] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:33:08,964 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:33:08,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30, 20] total 65 [2022-01-18 12:33:08,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341781576] [2022-01-18 12:33:08,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:33:08,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-01-18 12:33:08,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:33:08,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-01-18 12:33:08,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=3444, Unknown=3, NotChecked=366, Total=4160 [2022-01-18 12:33:08,966 INFO L87 Difference]: Start difference. First operand 17561 states and 65246 transitions. Second operand has 65 states, 65 states have (on average 4.630769230769231) internal successors, (301), 65 states have internal predecessors, (301), 0 states have call successors, (0), 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-01-18 12:33:46,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:33:46,858 INFO L93 Difference]: Finished difference Result 94532 states and 345562 transitions. [2022-01-18 12:33:46,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 519 states. [2022-01-18 12:33:46,859 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 4.630769230769231) internal successors, (301), 65 states have internal predecessors, (301), 0 states have call successors, (0), 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 124 [2022-01-18 12:33:46,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:33:47,220 INFO L225 Difference]: With dead ends: 94532 [2022-01-18 12:33:47,220 INFO L226 Difference]: Without dead ends: 94082 [2022-01-18 12:33:47,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 812 GetRequests, 232 SyntacticMatches, 20 SemanticMatches, 560 ConstructedPredicates, 3 IntricatePredicates, 5 DeprecatedPredicates, 141469 ImplicationChecksByTransitivity, 31.4s TimeCoverageRelationStatistics Valid=22968, Invalid=288963, Unknown=3, NotChecked=3348, Total=315282 [2022-01-18 12:33:47,460 INFO L933 BasicCegarLoop]: 701 mSDtfsCounter, 5523 mSDsluCounter, 16567 mSDsCounter, 0 mSdLazyCounter, 9442 mSolverCounterSat, 493 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5523 SdHoareTripleChecker+Valid, 15651 SdHoareTripleChecker+Invalid, 22439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 493 IncrementalHoareTripleChecker+Valid, 9442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12504 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-01-18 12:33:47,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5523 Valid, 15651 Invalid, 22439 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [493 Valid, 9442 Invalid, 0 Unknown, 12504 Unchecked, 4.9s Time] [2022-01-18 12:33:47,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94082 states. [2022-01-18 12:33:48,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94082 to 17409. [2022-01-18 12:33:48,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17409 states, 17408 states have (on average 3.7111672794117645) internal successors, (64604), 17408 states have internal predecessors, (64604), 0 states have call successors, (0), 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-01-18 12:33:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17409 states to 17409 states and 64604 transitions. [2022-01-18 12:33:48,641 INFO L78 Accepts]: Start accepts. Automaton has 17409 states and 64604 transitions. Word has length 124 [2022-01-18 12:33:48,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:33:48,642 INFO L470 AbstractCegarLoop]: Abstraction has 17409 states and 64604 transitions. [2022-01-18 12:33:48,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 4.630769230769231) internal successors, (301), 65 states have internal predecessors, (301), 0 states have call successors, (0), 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-01-18 12:33:48,642 INFO L276 IsEmpty]: Start isEmpty. Operand 17409 states and 64604 transitions. [2022-01-18 12:33:48,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-18 12:33:48,676 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:33:48,676 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] [2022-01-18 12:33:48,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-01-18 12:33:48,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-01-18 12:33:48,877 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 12:33:48,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:33:48,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1934802414, now seen corresponding path program 24 times [2022-01-18 12:33:48,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:33:48,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301890245] [2022-01-18 12:33:48,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:33:48,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:33:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:33:49,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:33:49,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:33:49,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301890245] [2022-01-18 12:33:49,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301890245] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:33:49,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151673961] [2022-01-18 12:33:49,435 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 12:33:49,435 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:33:49,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:33:49,436 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 12:33:49,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-01-18 12:33:49,574 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-01-18 12:33:49,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:33:49,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 55 conjunts are in the unsatisfiable core [2022-01-18 12:33:49,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:33:50,064 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:33:50,064 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 27 treesize of output 27 [2022-01-18 12:33:50,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:33:50,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:33:50,837 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:33:50,838 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 23 treesize of output 24 [2022-01-18 12:33:51,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:33:51,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151673961] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:33:51,243 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:33:51,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18, 17] total 51 [2022-01-18 12:33:51,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012647749] [2022-01-18 12:33:51,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:33:51,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-01-18 12:33:51,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:33:51,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-01-18 12:33:51,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=2260, Unknown=0, NotChecked=0, Total=2550 [2022-01-18 12:33:51,245 INFO L87 Difference]: Start difference. First operand 17409 states and 64604 transitions. Second operand has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 0 states have call successors, (0), 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-01-18 12:34:14,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:34:14,975 INFO L93 Difference]: Finished difference Result 91418 states and 334526 transitions. [2022-01-18 12:34:14,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 385 states. [2022-01-18 12:34:14,976 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 0 states have call successors, (0), 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 124 [2022-01-18 12:34:14,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. Received shutdown request... [2022-01-18 12:34:15,272 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-18 12:34:15,272 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-18 12:34:15,537 INFO L225 Difference]: With dead ends: 91418 [2022-01-18 12:34:15,537 INFO L226 Difference]: Without dead ends: 90968 [2022-01-18 12:34:15,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 235 SyntacticMatches, 25 SemanticMatches, 410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76418 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=16789, Invalid=152543, Unknown=0, NotChecked=0, Total=169332 [2022-01-18 12:34:15,542 INFO L933 BasicCegarLoop]: 510 mSDtfsCounter, 3637 mSDsluCounter, 14201 mSDsCounter, 0 mSdLazyCounter, 6797 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3637 SdHoareTripleChecker+Valid, 13314 SdHoareTripleChecker+Invalid, 19080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 6797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11962 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-01-18 12:34:15,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3637 Valid, 13314 Invalid, 19080 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [321 Valid, 6797 Invalid, 0 Unknown, 11962 Unchecked, 3.5s Time] [2022-01-18 12:34:15,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90968 states. [2022-01-18 12:34:15,669 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-18 12:34:15,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-01-18 12:34:15,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-01-18 12:34:15,870 WARN L594 AbstractCegarLoop]: Verification canceled: while executing MinimizeSevpa. [2022-01-18 12:34:15,872 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-01-18 12:34:15,872 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-01-18 12:34:15,872 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-01-18 12:34:15,874 INFO L732 BasicCegarLoop]: Path program histogram: [24, 9, 6, 1, 1, 1, 1, 1, 1] [2022-01-18 12:34:15,876 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-18 12:34:15,876 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-18 12:34:15,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 12:34:15 BasicIcfg [2022-01-18 12:34:15,878 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-18 12:34:15,878 INFO L158 Benchmark]: Toolchain (without parser) took 736010.15ms. Allocated memory was 367.0MB in the beginning and 4.7GB in the end (delta: 4.3GB). Free memory was 308.1MB in the beginning and 3.1GB in the end (delta: -2.8GB). Peak memory consumption was 1.9GB. Max. memory is 16.0GB. [2022-01-18 12:34:15,878 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 367.0MB. Free memory is still 325.2MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 12:34:15,878 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.62ms. Allocated memory was 367.0MB in the beginning and 474.0MB in the end (delta: 107.0MB). Free memory was 307.9MB in the beginning and 442.4MB in the end (delta: -134.5MB). Peak memory consumption was 6.5MB. Max. memory is 16.0GB. [2022-01-18 12:34:15,879 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.39ms. Allocated memory is still 474.0MB. Free memory was 442.4MB in the beginning and 439.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 12:34:15,879 INFO L158 Benchmark]: Boogie Preprocessor took 50.19ms. Allocated memory is still 474.0MB. Free memory was 439.2MB in the beginning and 438.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 12:34:15,879 INFO L158 Benchmark]: RCFGBuilder took 687.93ms. Allocated memory is still 474.0MB. Free memory was 438.2MB in the beginning and 408.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2022-01-18 12:34:15,879 INFO L158 Benchmark]: TraceAbstraction took 734898.05ms. Allocated memory was 474.0MB in the beginning and 4.7GB in the end (delta: 4.2GB). Free memory was 407.8MB in the beginning and 3.1GB in the end (delta: -2.7GB). Peak memory consumption was 1.9GB. Max. memory is 16.0GB. [2022-01-18 12:34:15,880 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.13ms. Allocated memory is still 367.0MB. Free memory is still 325.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 311.62ms. Allocated memory was 367.0MB in the beginning and 474.0MB in the end (delta: 107.0MB). Free memory was 307.9MB in the beginning and 442.4MB in the end (delta: -134.5MB). Peak memory consumption was 6.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.39ms. Allocated memory is still 474.0MB. Free memory was 442.4MB in the beginning and 439.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 50.19ms. Allocated memory is still 474.0MB. Free memory was 439.2MB in the beginning and 438.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 687.93ms. Allocated memory is still 474.0MB. Free memory was 438.2MB in the beginning and 408.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 734898.05ms. Allocated memory was 474.0MB in the beginning and 4.7GB in the end (delta: 4.2GB). Free memory was 407.8MB in the beginning and 3.1GB in the end (delta: -2.7GB). Peak memory consumption was 1.9GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 178 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 734.7s, OverallIterations: 45, TraceHistogramMax: 1, PathProgramHistogramMax: 24, EmptinessCheckTime: 1.2s, AutomataDifference: 427.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 88800 SdHoareTripleChecker+Valid, 82.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88800 mSDsluCounter, 337875 SdHoareTripleChecker+Invalid, 69.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 194841 IncrementalHoareTripleChecker+Unchecked, 353968 mSDsCounter, 4822 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 178355 IncrementalHoareTripleChecker+Invalid, 378018 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4822 mSolverCounterUnsat, 14513 mSDtfsCounter, 178355 mSolverCounterSat, 1.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16302 GetRequests, 8886 SyntacticMatches, 392 SemanticMatches, 7024 ConstructedPredicates, 127 IntricatePredicates, 39 DeprecatedPredicates, 915625 ImplicationChecksByTransitivity, 349.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17855occurred in iteration=39, InterpolantAutomatonStates: 5479, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.5s AutomataMinimizationTime, 45 MinimizatonAttempts, 1089810 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 270.2s InterpolantComputationTime, 10379 NumberOfCodeBlocks, 10369 NumberOfCodeBlocksAsserted, 120 NumberOfCheckSat, 15172 ConstructedInterpolants, 1420 QuantifiedInterpolants, 182069 SizeOfPredicates, 1367 NumberOfNonLiveVariables, 12792 ConjunctsInSsa, 2328 ConjunctsInUnsatCore, 125 InterpolantComputations, 8 PerfectInterpolantSequences, 69/342 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown