/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops/eureka_01-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-5d317bd [2022-03-18 21:37:22,895 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-18 21:37:22,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-18 21:37:22,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-18 21:37:22,927 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-18 21:37:22,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-18 21:37:22,929 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-18 21:37:22,931 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-18 21:37:22,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-18 21:37:22,936 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-18 21:37:22,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-18 21:37:22,938 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-18 21:37:22,938 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-18 21:37:22,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-18 21:37:22,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-18 21:37:22,944 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-18 21:37:22,944 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-18 21:37:22,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-18 21:37:22,947 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-18 21:37:22,952 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-18 21:37:22,953 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-18 21:37:22,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-18 21:37:22,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-18 21:37:22,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-18 21:37:22,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-18 21:37:22,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-18 21:37:22,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-18 21:37:22,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-18 21:37:22,964 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-18 21:37:22,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-18 21:37:22,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-18 21:37:22,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-18 21:37:22,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-18 21:37:22,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-18 21:37:22,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-18 21:37:22,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-18 21:37:22,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-18 21:37:22,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-18 21:37:22,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-18 21:37:22,969 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-18 21:37:22,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-18 21:37:22,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-18 21:37:22,971 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-03-18 21:37:22,994 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-18 21:37:22,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-18 21:37:22,996 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-18 21:37:22,996 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-18 21:37:22,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-18 21:37:22,997 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-18 21:37:22,997 INFO L138 SettingsManager]: * Use SBE=true [2022-03-18 21:37:22,997 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-18 21:37:22,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-18 21:37:22,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-18 21:37:22,998 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-18 21:37:22,998 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-18 21:37:22,999 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-18 21:37:22,999 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-18 21:37:22,999 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-18 21:37:22,999 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-18 21:37:22,999 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-18 21:37:22,999 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-18 21:37:22,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-18 21:37:22,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 21:37:22,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-18 21:37:23,000 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-18 21:37:23,000 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-18 21:37:23,000 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-18 21:37:23,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-18 21:37:23,000 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-18 21:37:23,000 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-03-18 21:37:23,000 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-03-18 21:37:23,001 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-18 21:37:23,001 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-18 21:37:23,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-18 21:37:23,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-18 21:37:23,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-18 21:37:23,200 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-18 21:37:23,201 INFO L275 PluginConnector]: CDTParser initialized [2022-03-18 21:37:23,202 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_01-1.c [2022-03-18 21:37:23,242 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50cd9c024/3005d2e8c53d44679bc52564cb0122a8/FLAG7a82e9bdf [2022-03-18 21:37:23,584 INFO L306 CDTParser]: Found 1 translation units. [2022-03-18 21:37:23,585 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01-1.c [2022-03-18 21:37:23,589 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50cd9c024/3005d2e8c53d44679bc52564cb0122a8/FLAG7a82e9bdf [2022-03-18 21:37:24,035 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50cd9c024/3005d2e8c53d44679bc52564cb0122a8 [2022-03-18 21:37:24,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-18 21:37:24,038 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-18 21:37:24,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-18 21:37:24,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-18 21:37:24,041 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-18 21:37:24,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 09:37:24" (1/1) ... [2022-03-18 21:37:24,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4006b031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 09:37:24, skipping insertion in model container [2022-03-18 21:37:24,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 09:37:24" (1/1) ... [2022-03-18 21:37:24,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-18 21:37:24,058 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-18 21:37:24,180 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01-1.c[446,459] [2022-03-18 21:37:24,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 21:37:24,208 INFO L203 MainTranslator]: Completed pre-run [2022-03-18 21:37:24,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01-1.c[446,459] [2022-03-18 21:37:24,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 21:37:24,241 INFO L208 MainTranslator]: Completed translation [2022-03-18 21:37:24,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 09:37:24 WrapperNode [2022-03-18 21:37:24,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-18 21:37:24,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-18 21:37:24,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-18 21:37:24,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-18 21:37:24,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 09:37:24" (1/1) ... [2022-03-18 21:37:24,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 09:37:24" (1/1) ... [2022-03-18 21:37:24,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 09:37:24" (1/1) ... [2022-03-18 21:37:24,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 09:37:24" (1/1) ... [2022-03-18 21:37:24,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 09:37:24" (1/1) ... [2022-03-18 21:37:24,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 09:37:24" (1/1) ... [2022-03-18 21:37:24,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 09:37:24" (1/1) ... [2022-03-18 21:37:24,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-18 21:37:24,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-18 21:37:24,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-18 21:37:24,285 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-18 21:37:24,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 09:37:24" (1/1) ... [2022-03-18 21:37:24,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 21:37:24,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 21:37:24,326 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-18 21:37:24,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-18 21:37:24,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-18 21:37:24,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-18 21:37:24,356 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-18 21:37:24,359 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-18 21:37:24,359 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-18 21:37:24,359 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-18 21:37:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-18 21:37:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-18 21:37:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-18 21:37:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-18 21:37:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-18 21:37:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-18 21:37:24,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-18 21:37:24,362 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-18 21:37:24,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-18 21:37:24,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-18 21:37:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-18 21:37:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-18 21:37:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-18 21:37:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-18 21:37:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-18 21:37:24,411 INFO L234 CfgBuilder]: Building ICFG [2022-03-18 21:37:24,412 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-18 21:37:24,673 INFO L275 CfgBuilder]: Performing block encoding [2022-03-18 21:37:24,678 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-18 21:37:24,678 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-03-18 21:37:24,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 09:37:24 BoogieIcfgContainer [2022-03-18 21:37:24,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-18 21:37:24,692 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-18 21:37:24,692 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-18 21:37:24,693 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-18 21:37:24,695 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 09:37:24" (1/1) ... [2022-03-18 21:37:24,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 18.03 09:37:24 BasicIcfg [2022-03-18 21:37:24,727 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-18 21:37:24,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-18 21:37:24,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-18 21:37:24,731 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-18 21:37:24,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.03 09:37:24" (1/4) ... [2022-03-18 21:37:24,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dd089a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 09:37:24, skipping insertion in model container [2022-03-18 21:37:24,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 09:37:24" (2/4) ... [2022-03-18 21:37:24,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dd089a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 09:37:24, skipping insertion in model container [2022-03-18 21:37:24,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 09:37:24" (3/4) ... [2022-03-18 21:37:24,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dd089a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.03 09:37:24, skipping insertion in model container [2022-03-18 21:37:24,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 18.03 09:37:24" (4/4) ... [2022-03-18 21:37:24,733 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_01-1.cqvasr [2022-03-18 21:37:24,736 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-18 21:37:24,736 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-18 21:37:24,771 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-18 21:37:24,778 INFO L340 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 [2022-03-18 21:37:24,778 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-18 21:37:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-18 21:37:24,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-18 21:37:24,802 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 21:37:24,803 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 21:37:24,803 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 21:37:24,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 21:37:24,807 INFO L85 PathProgramCache]: Analyzing trace with hash -950788698, now seen corresponding path program 1 times [2022-03-18 21:37:24,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 21:37:24,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11921381] [2022-03-18 21:37:24,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:37:24,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 21:37:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:24,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 21:37:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:25,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 21:37:25,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 21:37:25,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11921381] [2022-03-18 21:37:25,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11921381] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 21:37:25,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 21:37:25,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-18 21:37:25,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726451035] [2022-03-18 21:37:25,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 21:37:25,006 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-18 21:37:25,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 21:37:25,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-18 21:37:25,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-18 21:37:25,031 INFO L87 Difference]: Start difference. First operand has 37 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:37:25,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 21:37:25,078 INFO L93 Difference]: Finished difference Result 63 states and 89 transitions. [2022-03-18 21:37:25,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-18 21:37:25,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-18 21:37:25,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 21:37:25,085 INFO L225 Difference]: With dead ends: 63 [2022-03-18 21:37:25,086 INFO L226 Difference]: Without dead ends: 32 [2022-03-18 21:37:25,088 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-18 21:37:25,091 INFO L912 BasicCegarLoop]: 44 mSDtfsCounter, 37 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 21:37:25,092 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 47 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 21:37:25,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-03-18 21:37:25,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-03-18 21:37:25,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-18 21:37:25,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-03-18 21:37:25,121 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 19 [2022-03-18 21:37:25,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 21:37:25,122 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-03-18 21:37:25,122 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:37:25,122 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-03-18 21:37:25,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-18 21:37:25,123 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 21:37:25,123 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 21:37:25,124 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-18 21:37:25,124 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 21:37:25,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 21:37:25,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1860236376, now seen corresponding path program 1 times [2022-03-18 21:37:25,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 21:37:25,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563030975] [2022-03-18 21:37:25,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:37:25,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 21:37:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:25,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 21:37:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:25,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 21:37:25,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 21:37:25,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563030975] [2022-03-18 21:37:25,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563030975] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 21:37:25,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 21:37:25,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-18 21:37:25,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918778288] [2022-03-18 21:37:25,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 21:37:25,242 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-18 21:37:25,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 21:37:25,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-18 21:37:25,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-18 21:37:25,243 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:37:25,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 21:37:25,406 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2022-03-18 21:37:25,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-18 21:37:25,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-18 21:37:25,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 21:37:25,408 INFO L225 Difference]: With dead ends: 80 [2022-03-18 21:37:25,408 INFO L226 Difference]: Without dead ends: 48 [2022-03-18 21:37:25,410 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-18 21:37:25,410 INFO L912 BasicCegarLoop]: 24 mSDtfsCounter, 85 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 21:37:25,411 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 36 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 21:37:25,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-03-18 21:37:25,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2022-03-18 21:37:25,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-18 21:37:25,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-03-18 21:37:25,418 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 19 [2022-03-18 21:37:25,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 21:37:25,419 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-03-18 21:37:25,419 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:37:25,419 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-03-18 21:37:25,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-18 21:37:25,419 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 21:37:25,420 INFO L500 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] [2022-03-18 21:37:25,420 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-18 21:37:25,420 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 21:37:25,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 21:37:25,421 INFO L85 PathProgramCache]: Analyzing trace with hash 600491494, now seen corresponding path program 1 times [2022-03-18 21:37:25,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 21:37:25,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115491763] [2022-03-18 21:37:25,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:37:25,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 21:37:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:25,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 21:37:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:25,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 21:37:25,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 21:37:25,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115491763] [2022-03-18 21:37:25,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115491763] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 21:37:25,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696441214] [2022-03-18 21:37:25,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:37:25,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:37:25,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 21:37:25,644 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 21:37:25,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-18 21:37:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:25,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-18 21:37:25,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 21:37:25,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-18 21:37:25,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-03-18 21:37:25,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 21:37:25,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 21:37:25,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-03-18 21:37:25,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-03-18 21:37:26,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 21:37:26,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696441214] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 21:37:26,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 21:37:26,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-03-18 21:37:26,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663581787] [2022-03-18 21:37:26,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 21:37:26,002 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-18 21:37:26,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 21:37:26,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-18 21:37:26,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-03-18 21:37:26,004 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:37:26,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 21:37:26,399 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2022-03-18 21:37:26,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-18 21:37:26,399 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-03-18 21:37:26,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 21:37:26,400 INFO L225 Difference]: With dead ends: 91 [2022-03-18 21:37:26,400 INFO L226 Difference]: Without dead ends: 89 [2022-03-18 21:37:26,401 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2022-03-18 21:37:26,401 INFO L912 BasicCegarLoop]: 24 mSDtfsCounter, 157 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-18 21:37:26,402 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 72 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-18 21:37:26,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-03-18 21:37:26,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 55. [2022-03-18 21:37:26,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 48 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-18 21:37:26,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2022-03-18 21:37:26,409 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 25 [2022-03-18 21:37:26,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 21:37:26,409 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2022-03-18 21:37:26,409 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:37:26,409 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2022-03-18 21:37:26,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-18 21:37:26,410 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 21:37:26,410 INFO L500 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] [2022-03-18 21:37:26,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-18 21:37:26,623 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:37:26,624 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 21:37:26,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 21:37:26,624 INFO L85 PathProgramCache]: Analyzing trace with hash 89957317, now seen corresponding path program 1 times [2022-03-18 21:37:26,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 21:37:26,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253250745] [2022-03-18 21:37:26,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:37:26,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 21:37:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:26,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 21:37:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 21:37:26,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 21:37:26,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253250745] [2022-03-18 21:37:26,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253250745] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 21:37:26,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 21:37:26,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 21:37:26,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207946536] [2022-03-18 21:37:26,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 21:37:26,680 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 21:37:26,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 21:37:26,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 21:37:26,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 21:37:26,681 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:37:26,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 21:37:26,728 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-03-18 21:37:26,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 21:37:26,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-03-18 21:37:26,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 21:37:26,731 INFO L225 Difference]: With dead ends: 82 [2022-03-18 21:37:26,732 INFO L226 Difference]: Without dead ends: 57 [2022-03-18 21:37:26,733 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-18 21:37:26,743 INFO L912 BasicCegarLoop]: 33 mSDtfsCounter, 34 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 21:37:26,744 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 40 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 21:37:26,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-03-18 21:37:26,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-03-18 21:37:26,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 49 states have internal predecessors, (61), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-18 21:37:26,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2022-03-18 21:37:26,749 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 25 [2022-03-18 21:37:26,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 21:37:26,749 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2022-03-18 21:37:26,749 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:37:26,749 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2022-03-18 21:37:26,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-18 21:37:26,750 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 21:37:26,750 INFO L500 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] [2022-03-18 21:37:26,750 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-18 21:37:26,750 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 21:37:26,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 21:37:26,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1971894797, now seen corresponding path program 1 times [2022-03-18 21:37:26,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 21:37:26,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071581622] [2022-03-18 21:37:26,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:37:26,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 21:37:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:26,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 21:37:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:26,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 21:37:26,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 21:37:26,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071581622] [2022-03-18 21:37:26,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071581622] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 21:37:26,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683628225] [2022-03-18 21:37:26,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:37:26,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:37:26,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 21:37:26,838 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 21:37:26,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-18 21:37:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:26,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-18 21:37:26,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 21:37:26,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 21:37:26,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 21:37:27,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 21:37:27,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683628225] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 21:37:27,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 21:37:27,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-03-18 21:37:27,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972108210] [2022-03-18 21:37:27,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 21:37:27,011 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-18 21:37:27,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 21:37:27,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-18 21:37:27,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-03-18 21:37:27,012 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:37:27,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 21:37:27,194 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2022-03-18 21:37:27,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-18 21:37:27,194 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-03-18 21:37:27,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 21:37:27,195 INFO L225 Difference]: With dead ends: 130 [2022-03-18 21:37:27,195 INFO L226 Difference]: Without dead ends: 94 [2022-03-18 21:37:27,196 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-03-18 21:37:27,196 INFO L912 BasicCegarLoop]: 41 mSDtfsCounter, 111 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 21:37:27,196 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 63 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 21:37:27,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-03-18 21:37:27,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 68. [2022-03-18 21:37:27,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 61 states have internal predecessors, (77), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-18 21:37:27,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2022-03-18 21:37:27,204 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 28 [2022-03-18 21:37:27,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 21:37:27,204 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2022-03-18 21:37:27,204 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:37:27,204 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2022-03-18 21:37:27,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-18 21:37:27,205 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 21:37:27,205 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 21:37:27,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-18 21:37:27,421 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:37:27,422 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 21:37:27,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 21:37:27,422 INFO L85 PathProgramCache]: Analyzing trace with hash -190528417, now seen corresponding path program 1 times [2022-03-18 21:37:27,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 21:37:27,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506005452] [2022-03-18 21:37:27,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:37:27,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 21:37:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:27,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 21:37:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 21:37:27,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 21:37:27,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506005452] [2022-03-18 21:37:27,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506005452] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 21:37:27,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473124494] [2022-03-18 21:37:27,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:37:27,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:37:27,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 21:37:27,512 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 21:37:27,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-18 21:37:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:27,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-18 21:37:27,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 21:37:27,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 21:37:27,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 21:37:27,713 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 21:37:27,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473124494] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 21:37:27,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 21:37:27,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-03-18 21:37:27,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432110920] [2022-03-18 21:37:27,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 21:37:27,714 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-18 21:37:27,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 21:37:27,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-18 21:37:27,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-03-18 21:37:27,714 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:37:27,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 21:37:27,940 INFO L93 Difference]: Finished difference Result 195 states and 249 transitions. [2022-03-18 21:37:27,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-18 21:37:27,941 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-03-18 21:37:27,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 21:37:27,941 INFO L225 Difference]: With dead ends: 195 [2022-03-18 21:37:27,941 INFO L226 Difference]: Without dead ends: 165 [2022-03-18 21:37:27,942 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2022-03-18 21:37:27,942 INFO L912 BasicCegarLoop]: 53 mSDtfsCounter, 150 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-18 21:37:27,942 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 80 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-18 21:37:27,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-03-18 21:37:27,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 87. [2022-03-18 21:37:27,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 80 states have internal predecessors, (103), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-18 21:37:27,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2022-03-18 21:37:27,952 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 28 [2022-03-18 21:37:27,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 21:37:27,952 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2022-03-18 21:37:27,952 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:37:27,952 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2022-03-18 21:37:27,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-18 21:37:27,953 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 21:37:27,953 INFO L500 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] [2022-03-18 21:37:27,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-18 21:37:28,171 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:37:28,172 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 21:37:28,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 21:37:28,172 INFO L85 PathProgramCache]: Analyzing trace with hash -85381645, now seen corresponding path program 1 times [2022-03-18 21:37:28,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 21:37:28,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986582903] [2022-03-18 21:37:28,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:37:28,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 21:37:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:28,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 21:37:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:28,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 21:37:28,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 21:37:28,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986582903] [2022-03-18 21:37:28,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986582903] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 21:37:28,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123676319] [2022-03-18 21:37:28,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:37:28,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:37:28,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 21:37:28,573 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 21:37:28,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-03-18 21:37:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:28,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-18 21:37:28,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 21:37:28,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 77 [2022-03-18 21:37:28,752 INFO L390 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 19 treesize of output 18 [2022-03-18 21:37:28,899 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-03-18 21:37:28,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-03-18 21:37:29,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-03-18 21:37:29,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 21:37:29,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 21:37:31,248 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0_9 Int)) (or (forall ((v_ArrVal_192 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |c_main_~#distance~0.offset|) v_ArrVal_192) |c_main_~#distance~0.offset|))) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) v_main_~x~0_9)))) is different from false [2022-03-18 21:37:31,741 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0_9 Int) (v_ArrVal_192 Int)) (or (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_9)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |c_main_~#distance~0.offset|) v_ArrVal_192) |c_main_~#distance~0.offset|)))) is different from false [2022-03-18 21:37:32,170 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0_9 Int) (v_ArrVal_192 Int) (v_ArrVal_191 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|) v_ArrVal_191))) (or (<= 0 (select (store .cse0 (+ (* v_main_~x~0_9 4) |c_main_~#distance~0.offset|) v_ArrVal_192) |c_main_~#distance~0.offset|)) (not (<= (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse0) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_9)) (not (<= 0 v_ArrVal_191))))) is different from false [2022-03-18 21:37:32,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-03-18 21:37:32,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123676319] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 21:37:32,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 21:37:32,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 29 [2022-03-18 21:37:32,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056521956] [2022-03-18 21:37:32,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 21:37:32,217 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-18 21:37:32,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 21:37:32,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-18 21:37:32,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=556, Unknown=3, NotChecked=150, Total=812 [2022-03-18 21:37:32,218 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:37:32,568 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (forall ((v_main_~x~0_9 Int) (v_ArrVal_192 Int)) (or (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_9)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |c_main_~#distance~0.offset|) v_ArrVal_192) |c_main_~#distance~0.offset|)))) (= c_main_~i~0 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|)) 0) (<= |c_main_~#Dest~0.offset| 0) (<= 0 |c_main_~#Dest~0.offset|) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-03-18 21:37:32,848 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (forall ((v_main_~x~0_9 Int) (v_ArrVal_192 Int)) (or (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_9)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |c_main_~#distance~0.offset|) v_ArrVal_192) |c_main_~#distance~0.offset|)))) (= |c_main_~#Dest~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) 0) 0)) is different from false [2022-03-18 21:37:34,870 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|))) (and (forall ((v_main_~x~0_9 Int)) (or (forall ((v_ArrVal_192 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |c_main_~#distance~0.offset|) v_ArrVal_192) |c_main_~#distance~0.offset|))) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) v_main_~x~0_9)))) (= .cse0 0) (= |c_main_~#distance~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) 0) 0) (= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) .cse0) 1) (= c_main_~j~0 0))) is different from false [2022-03-18 21:37:35,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 21:37:35,174 INFO L93 Difference]: Finished difference Result 146 states and 186 transitions. [2022-03-18 21:37:35,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-18 21:37:35,175 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-03-18 21:37:35,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 21:37:35,176 INFO L225 Difference]: With dead ends: 146 [2022-03-18 21:37:35,176 INFO L226 Difference]: Without dead ends: 144 [2022-03-18 21:37:35,177 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=197, Invalid=1153, Unknown=6, NotChecked=450, Total=1806 [2022-03-18 21:37:35,177 INFO L912 BasicCegarLoop]: 51 mSDtfsCounter, 56 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 418 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 21:37:35,178 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 153 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 339 Invalid, 0 Unknown, 418 Unchecked, 0.1s Time] [2022-03-18 21:37:35,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-03-18 21:37:35,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 92. [2022-03-18 21:37:35,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 84 states have (on average 1.3214285714285714) internal successors, (111), 85 states have internal predecessors, (111), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-18 21:37:35,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 118 transitions. [2022-03-18 21:37:35,188 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 118 transitions. Word has length 31 [2022-03-18 21:37:35,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 21:37:35,188 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 118 transitions. [2022-03-18 21:37:35,188 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:37:35,188 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 118 transitions. [2022-03-18 21:37:35,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-18 21:37:35,192 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 21:37:35,192 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 21:37:35,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-18 21:37:35,411 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:37:35,412 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 21:37:35,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 21:37:35,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1897789399, now seen corresponding path program 2 times [2022-03-18 21:37:35,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 21:37:35,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469950496] [2022-03-18 21:37:35,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:37:35,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 21:37:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:35,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 21:37:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:35,577 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-18 21:37:35,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 21:37:35,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469950496] [2022-03-18 21:37:35,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469950496] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 21:37:35,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207720398] [2022-03-18 21:37:35,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 21:37:35,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:37:35,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 21:37:35,580 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 21:37:35,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-18 21:37:35,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 21:37:35,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 21:37:35,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-18 21:37:35,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 21:37:35,671 INFO L390 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-03-18 21:37:35,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 21:37:35,712 INFO L390 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 23 treesize of output 22 [2022-03-18 21:37:35,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-03-18 21:37:35,821 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-18 21:37:35,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 21:37:37,927 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_56 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_56)) (forall ((v_ArrVal_233 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* v_main_~i~0_56 4)) v_ArrVal_233) |c_main_~#distance~0.offset|))))) is different from false [2022-03-18 21:37:37,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-03-18 21:37:37,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 150 [2022-03-18 21:37:38,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 1 not checked. [2022-03-18 21:37:38,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207720398] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 21:37:38,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 21:37:38,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 22 [2022-03-18 21:37:38,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874581858] [2022-03-18 21:37:38,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 21:37:38,065 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-18 21:37:38,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 21:37:38,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-18 21:37:38,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=353, Unknown=1, NotChecked=38, Total=462 [2022-03-18 21:37:38,066 INFO L87 Difference]: Start difference. First operand 92 states and 118 transitions. Second operand has 22 states, 20 states have (on average 2.95) internal successors, (59), 19 states have internal predecessors, (59), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:37:40,103 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (= c_main_~i~0 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|)) 0) (forall ((v_main_~i~0_56 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_56)) (forall ((v_ArrVal_233 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* v_main_~i~0_56 4)) v_ArrVal_233) |c_main_~#distance~0.offset|))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-03-18 21:37:40,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 21:37:40,451 INFO L93 Difference]: Finished difference Result 168 states and 212 transitions. [2022-03-18 21:37:40,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-18 21:37:40,451 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.95) internal successors, (59), 19 states have internal predecessors, (59), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-03-18 21:37:40,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 21:37:40,452 INFO L225 Difference]: With dead ends: 168 [2022-03-18 21:37:40,452 INFO L226 Difference]: Without dead ends: 166 [2022-03-18 21:37:40,453 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=162, Invalid=774, Unknown=2, NotChecked=118, Total=1056 [2022-03-18 21:37:40,453 INFO L912 BasicCegarLoop]: 28 mSDtfsCounter, 175 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-18 21:37:40,453 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 80 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 581 Invalid, 0 Unknown, 83 Unchecked, 0.2s Time] [2022-03-18 21:37:40,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-03-18 21:37:40,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 80. [2022-03-18 21:37:40,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 73 states have internal predecessors, (94), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-18 21:37:40,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2022-03-18 21:37:40,462 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 31 [2022-03-18 21:37:40,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 21:37:40,462 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2022-03-18 21:37:40,462 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.95) internal successors, (59), 19 states have internal predecessors, (59), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:37:40,462 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2022-03-18 21:37:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-18 21:37:40,463 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 21:37:40,463 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 21:37:40,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-18 21:37:40,663 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:37:40,664 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 21:37:40,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 21:37:40,664 INFO L85 PathProgramCache]: Analyzing trace with hash 873363003, now seen corresponding path program 1 times [2022-03-18 21:37:40,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 21:37:40,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948531938] [2022-03-18 21:37:40,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:37:40,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 21:37:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:40,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 21:37:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:40,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-18 21:37:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:40,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 21:37:40,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 21:37:40,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948531938] [2022-03-18 21:37:40,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948531938] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 21:37:40,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982347571] [2022-03-18 21:37:40,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:37:40,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:37:40,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 21:37:40,740 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 21:37:40,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-18 21:37:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:40,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-18 21:37:40,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 21:37:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 21:37:40,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 21:37:40,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 21:37:40,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982347571] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 21:37:40,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 21:37:40,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-03-18 21:37:40,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128413941] [2022-03-18 21:37:40,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 21:37:40,938 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-18 21:37:40,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 21:37:40,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-18 21:37:40,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-03-18 21:37:40,939 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-18 21:37:41,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 21:37:41,157 INFO L93 Difference]: Finished difference Result 206 states and 262 transitions. [2022-03-18 21:37:41,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-18 21:37:41,157 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2022-03-18 21:37:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 21:37:41,158 INFO L225 Difference]: With dead ends: 206 [2022-03-18 21:37:41,158 INFO L226 Difference]: Without dead ends: 138 [2022-03-18 21:37:41,159 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-03-18 21:37:41,159 INFO L912 BasicCegarLoop]: 26 mSDtfsCounter, 197 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 21:37:41,160 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 53 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 21:37:41,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-03-18 21:37:41,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 96. [2022-03-18 21:37:41,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 89 states have internal predecessors, (111), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-18 21:37:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 119 transitions. [2022-03-18 21:37:41,169 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 119 transitions. Word has length 33 [2022-03-18 21:37:41,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 21:37:41,169 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 119 transitions. [2022-03-18 21:37:41,169 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-18 21:37:41,170 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2022-03-18 21:37:41,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-18 21:37:41,170 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 21:37:41,170 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 21:37:41,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-18 21:37:41,387 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:37:41,387 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 21:37:41,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 21:37:41,387 INFO L85 PathProgramCache]: Analyzing trace with hash 2112270400, now seen corresponding path program 2 times [2022-03-18 21:37:41,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 21:37:41,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269676699] [2022-03-18 21:37:41,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:37:41,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 21:37:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:41,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 21:37:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:41,451 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 21:37:41,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 21:37:41,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269676699] [2022-03-18 21:37:41,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269676699] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 21:37:41,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860149351] [2022-03-18 21:37:41,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 21:37:41,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:37:41,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 21:37:41,452 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 21:37:41,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-18 21:37:41,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 21:37:41,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 21:37:41,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-18 21:37:41,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 21:37:41,616 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 21:37:41,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 21:37:41,670 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 21:37:41,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860149351] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 21:37:41,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 21:37:41,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-03-18 21:37:41,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190845263] [2022-03-18 21:37:41,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 21:37:41,671 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-18 21:37:41,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 21:37:41,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-18 21:37:41,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-18 21:37:41,671 INFO L87 Difference]: Start difference. First operand 96 states and 119 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:37:41,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 21:37:41,962 INFO L93 Difference]: Finished difference Result 195 states and 241 transitions. [2022-03-18 21:37:41,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-18 21:37:41,963 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-03-18 21:37:41,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 21:37:41,964 INFO L225 Difference]: With dead ends: 195 [2022-03-18 21:37:41,964 INFO L226 Difference]: Without dead ends: 174 [2022-03-18 21:37:41,964 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-03-18 21:37:41,965 INFO L912 BasicCegarLoop]: 48 mSDtfsCounter, 117 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-18 21:37:41,965 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 85 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-18 21:37:41,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-03-18 21:37:41,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 128. [2022-03-18 21:37:41,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 119 states have (on average 1.2773109243697478) internal successors, (152), 121 states have internal predecessors, (152), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-18 21:37:41,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 160 transitions. [2022-03-18 21:37:41,980 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 160 transitions. Word has length 34 [2022-03-18 21:37:41,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 21:37:41,981 INFO L478 AbstractCegarLoop]: Abstraction has 128 states and 160 transitions. [2022-03-18 21:37:41,981 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:37:41,981 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 160 transitions. [2022-03-18 21:37:41,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-18 21:37:41,981 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 21:37:41,981 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 21:37:42,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-18 21:37:42,198 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:37:42,199 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 21:37:42,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 21:37:42,199 INFO L85 PathProgramCache]: Analyzing trace with hash -848526202, now seen corresponding path program 3 times [2022-03-18 21:37:42,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 21:37:42,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666577509] [2022-03-18 21:37:42,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:37:42,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 21:37:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:42,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 21:37:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:37:42,783 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 21:37:42,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 21:37:42,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666577509] [2022-03-18 21:37:42,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666577509] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 21:37:42,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757833211] [2022-03-18 21:37:42,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-18 21:37:42,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:37:42,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 21:37:42,785 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 21:37:42,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-18 21:37:42,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-18 21:37:42,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 21:37:42,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-18 21:37:42,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 21:37:42,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-03-18 21:37:42,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 21:37:42,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 21:37:42,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 21:37:42,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-03-18 21:37:43,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 21:37:43,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 21:37:43,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 21:37:43,187 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-18 21:37:43,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 21:37:43,194 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-03-18 21:37:43,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 63 [2022-03-18 21:37:43,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 21:37:43,322 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-03-18 21:37:43,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 68 [2022-03-18 21:37:44,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2022-03-18 21:37:44,673 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 21:37:44,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 21:38:05,692 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int) (v_main_~x~0_19 Int)) (or (<= v_main_~j~0_28 0) (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351))) (store .cse0 (+ (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse0) |c_main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_353)) |c_main_~#distance~0.offset|)) (not (<= v_main_~j~0_28 1)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_19)))) is different from false [2022-03-18 21:38:07,868 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int) (v_main_~x~0_19 Int) (v_ArrVal_349 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|) v_ArrVal_349))) (or (not (<= (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse0) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_19)) (<= 0 (select (let ((.cse1 (store .cse0 (+ |c_main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351))) (store .cse1 (+ (* 4 (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse1) |c_main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |c_main_~#Dest~0.offset|))) |c_main_~#distance~0.offset|) v_ArrVal_353)) |c_main_~#distance~0.offset|)) (<= v_main_~j~0_28 0) (not (<= 0 v_ArrVal_349)) (not (<= v_main_~j~0_28 1))))) is different from false [2022-03-18 21:38:07,964 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-18 21:38:07,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757833211] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 21:38:07,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 21:38:07,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 48 [2022-03-18 21:38:07,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828976336] [2022-03-18 21:38:07,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 21:38:07,965 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-03-18 21:38:07,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 21:38:07,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-03-18 21:38:07,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1753, Unknown=11, NotChecked=178, Total=2256 [2022-03-18 21:38:07,966 INFO L87 Difference]: Start difference. First operand 128 states and 160 transitions. Second operand has 48 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 45 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:38:12,956 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (let ((.cse0 (select .cse1 |c_main_~#Dest~0.offset|)) (.cse2 (select |c_#memory_int| |c_main_~#distance~0.base|))) (and (= .cse0 1) (= |c_main_~#distance~0.offset| 0) (= (select .cse1 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= c_main_~i~0 0) (= (select .cse2 (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|)) 0) (<= 1 .cse0) (forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int) (v_main_~x~0_19 Int)) (or (<= v_main_~j~0_28 0) (<= 0 (select (let ((.cse3 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351))) (store .cse3 (+ (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse3) |c_main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_353)) |c_main_~#distance~0.offset|)) (not (<= v_main_~j~0_28 1)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_19)))) (<= |c_main_~#Dest~0.offset| 0) (= 3 (select .cse1 (+ 4 |c_main_~#Dest~0.offset|))) (<= 0 (select .cse2 |c_main_~#distance~0.offset|)) (<= 0 |c_main_~#Dest~0.offset|)))) is different from false [2022-03-18 21:38:13,448 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (let ((.cse0 (select .cse1 |c_main_~#Dest~0.offset|)) (.cse2 (select |c_#memory_int| |c_main_~#distance~0.base|))) (and (= .cse0 1) (= |c_main_~#distance~0.offset| 0) (= (select .cse1 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= (select .cse2 0) 0) (<= 1 .cse0) (forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int) (v_main_~x~0_19 Int)) (or (<= v_main_~j~0_28 0) (<= 0 (select (let ((.cse3 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351))) (store .cse3 (+ (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse3) |c_main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_353)) |c_main_~#distance~0.offset|)) (not (<= v_main_~j~0_28 1)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_19)))) (= 3 (select .cse1 (+ 4 |c_main_~#Dest~0.offset|))) (<= 0 (select .cse2 |c_main_~#distance~0.offset|))))) is different from false [2022-03-18 21:38:14,201 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (let ((.cse0 (select .cse1 |c_main_~#Dest~0.offset|)) (.cse2 (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) (.cse4 (+ 4 |c_main_~#Dest~0.offset|)) (.cse3 (select |c_#memory_int| |c_main_~#distance~0.base|))) (and (<= c_main_~j~0 1) (= |c_#NULL.base| |c_old(#NULL.base)|) (= .cse0 1) (= (select .cse1 .cse2) 3) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (= (select .cse1 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= (select .cse3 0) 0) (not (= (+ (* 4 c_main_~x~0) |c_main_~#distance~0.offset|) 0)) (<= 1 .cse0) (= .cse2 .cse4) (exists ((|main_~#Dest~0.base| Int)) (let ((.cse5 (select |c_#memory_int| |main_~#Dest~0.base|))) (and (<= 1 (select .cse5 0)) (= 3 (select .cse5 4)) (= (select .cse5 8) 4) (= c_main_~x~0 (select .cse5 (* c_main_~j~0 4))) (not (= |main_~#Dest~0.base| |c_main_~#distance~0.base|))))) (= 3 (select .cse1 .cse4)) (<= 0 (select .cse3 |c_main_~#distance~0.offset|)) (forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (<= 0 (select (let ((.cse6 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* 4 c_main_~x~0) |c_main_~#distance~0.offset|) v_ArrVal_351))) (store .cse6 (+ (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse6) |c_main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_353)) |c_main_~#distance~0.offset|)) (<= v_main_~j~0_28 0) (not (<= v_main_~j~0_28 (+ c_main_~j~0 1))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|)))) is different from false [2022-03-18 21:38:16,208 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_main_~j~0 1) (forall ((v_main_~j~0_28 Int)) (or (<= v_main_~j~0_28 0) (not (<= v_main_~j~0_28 (+ c_main_~j~0 1))) (forall ((v_ArrVal_353 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_353) |c_main_~#distance~0.offset|))))) (= |c_main_~#distance~0.offset| 0) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) 0) 0) (exists ((|main_~#Dest~0.base| Int)) (let ((.cse0 (select |c_#memory_int| |main_~#Dest~0.base|))) (and (<= 1 (select .cse0 0)) (= 3 (select .cse0 4)) (= (select .cse0 8) 4) (or (= (+ (* 4 (select .cse0 (* c_main_~j~0 4))) |c_main_~#distance~0.offset|) |c_main_~#distance~0.offset|) (<= 0 (select (select |c_#memory_int| |c_main_~#distance~0.base|) |c_main_~#distance~0.offset|))) (not (= |main_~#Dest~0.base| |c_main_~#distance~0.base|))))) (= (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|) (+ 4 |c_main_~#Dest~0.offset|))) is different from false [2022-03-18 21:38:17,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 21:38:17,070 INFO L93 Difference]: Finished difference Result 173 states and 211 transitions. [2022-03-18 21:38:17,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-18 21:38:17,070 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 45 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-03-18 21:38:17,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 21:38:17,071 INFO L225 Difference]: With dead ends: 173 [2022-03-18 21:38:17,071 INFO L226 Difference]: Without dead ends: 141 [2022-03-18 21:38:17,073 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 76 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1344 ImplicationChecksByTransitivity, 32.3s TimeCoverageRelationStatistics Valid=670, Invalid=4451, Unknown=15, NotChecked=870, Total=6006 [2022-03-18 21:38:17,073 INFO L912 BasicCegarLoop]: 36 mSDtfsCounter, 69 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 332 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-18 21:38:17,073 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 218 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 437 Invalid, 0 Unknown, 332 Unchecked, 0.2s Time] [2022-03-18 21:38:17,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-03-18 21:38:17,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2022-03-18 21:38:17,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 128 states have (on average 1.28125) internal successors, (164), 130 states have internal predecessors, (164), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-18 21:38:17,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 172 transitions. [2022-03-18 21:38:17,085 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 172 transitions. Word has length 37 [2022-03-18 21:38:17,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 21:38:17,085 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 172 transitions. [2022-03-18 21:38:17,085 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 45 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:38:17,085 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 172 transitions. [2022-03-18 21:38:17,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-18 21:38:17,086 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 21:38:17,086 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 21:38:17,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-18 21:38:17,301 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-18 21:38:17,301 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 21:38:17,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 21:38:17,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1692998073, now seen corresponding path program 1 times [2022-03-18 21:38:17,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 21:38:17,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039437774] [2022-03-18 21:38:17,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:38:17,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 21:38:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:38:17,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 21:38:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:38:17,631 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-18 21:38:17,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 21:38:17,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039437774] [2022-03-18 21:38:17,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039437774] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 21:38:17,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713143575] [2022-03-18 21:38:17,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:38:17,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:38:17,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 21:38:17,632 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 21:38:17,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-18 21:38:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:38:17,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-18 21:38:17,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 21:38:17,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2022-03-18 21:38:17,866 INFO L390 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 19 treesize of output 18 [2022-03-18 21:38:18,007 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-03-18 21:38:18,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-03-18 21:38:18,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-03-18 21:38:18,265 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-18 21:38:18,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 21:38:20,375 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0_24 Int)) (or (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) v_main_~x~0_24)) (forall ((v_ArrVal_396 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_24 4) |c_main_~#distance~0.offset|) v_ArrVal_396) |c_main_~#distance~0.offset|))))) is different from false [2022-03-18 21:38:20,800 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_396 Int) (v_main_~x~0_24 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_24 4) |c_main_~#distance~0.offset|) v_ArrVal_396) |c_main_~#distance~0.offset|)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_24)))) is different from false [2022-03-18 21:38:21,385 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_396 Int) (v_ArrVal_394 Int) (v_main_~x~0_24 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|) v_ArrVal_394))) (or (not (<= (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse0) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_24)) (<= 0 (select (store .cse0 (+ (* v_main_~x~0_24 4) |c_main_~#distance~0.offset|) v_ArrVal_396) |c_main_~#distance~0.offset|)) (not (<= 0 v_ArrVal_394))))) is different from false [2022-03-18 21:38:21,421 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 4 not checked. [2022-03-18 21:38:21,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713143575] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 21:38:21,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 21:38:21,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 30 [2022-03-18 21:38:21,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210216209] [2022-03-18 21:38:21,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 21:38:21,422 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-18 21:38:21,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 21:38:21,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-18 21:38:21,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=599, Unknown=3, NotChecked=156, Total=870 [2022-03-18 21:38:21,423 INFO L87 Difference]: Start difference. First operand 137 states and 172 transitions. Second operand has 30 states, 28 states have (on average 2.857142857142857) internal successors, (80), 27 states have internal predecessors, (80), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:38:22,616 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (forall ((v_ArrVal_396 Int) (v_main_~x~0_24 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_24 4) |c_main_~#distance~0.offset|) v_ArrVal_396) |c_main_~#distance~0.offset|)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_24)))) (= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (= |c_main_~#Dest~0.offset| 0) (= c_main_~i~0 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|)) 0) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-03-18 21:38:22,949 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_396 Int) (v_main_~x~0_24 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_24 4) |c_main_~#distance~0.offset|) v_ArrVal_396) |c_main_~#distance~0.offset|)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_24)))) (= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (= |c_main_~#Dest~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) 0) 0)) is different from false [2022-03-18 21:38:24,973 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|))) (and (= .cse0 0) (= |c_main_~#distance~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) 0) 0) (= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) .cse0) 1) (forall ((v_main_~x~0_24 Int)) (or (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) v_main_~x~0_24)) (forall ((v_ArrVal_396 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_24 4) |c_main_~#distance~0.offset|) v_ArrVal_396) |c_main_~#distance~0.offset|))))) (= c_main_~j~0 0))) is different from false [2022-03-18 21:38:25,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 21:38:25,235 INFO L93 Difference]: Finished difference Result 161 states and 198 transitions. [2022-03-18 21:38:25,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-18 21:38:25,235 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.857142857142857) internal successors, (80), 27 states have internal predecessors, (80), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-03-18 21:38:25,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 21:38:25,236 INFO L225 Difference]: With dead ends: 161 [2022-03-18 21:38:25,236 INFO L226 Difference]: Without dead ends: 142 [2022-03-18 21:38:25,237 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=186, Invalid=1092, Unknown=6, NotChecked=438, Total=1722 [2022-03-18 21:38:25,237 INFO L912 BasicCegarLoop]: 44 mSDtfsCounter, 46 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 277 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 21:38:25,237 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 203 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 308 Invalid, 0 Unknown, 277 Unchecked, 0.1s Time] [2022-03-18 21:38:25,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-03-18 21:38:25,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2022-03-18 21:38:25,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 125 states have (on average 1.28) internal successors, (160), 127 states have internal predecessors, (160), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-18 21:38:25,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 168 transitions. [2022-03-18 21:38:25,248 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 168 transitions. Word has length 37 [2022-03-18 21:38:25,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 21:38:25,249 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 168 transitions. [2022-03-18 21:38:25,249 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.857142857142857) internal successors, (80), 27 states have internal predecessors, (80), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:38:25,249 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 168 transitions. [2022-03-18 21:38:25,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-18 21:38:25,249 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 21:38:25,249 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 21:38:25,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-18 21:38:25,467 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:38:25,467 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 21:38:25,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 21:38:25,467 INFO L85 PathProgramCache]: Analyzing trace with hash 672670965, now seen corresponding path program 4 times [2022-03-18 21:38:25,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 21:38:25,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897366255] [2022-03-18 21:38:25,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:38:25,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 21:38:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:38:25,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 21:38:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:38:25,521 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-18 21:38:25,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 21:38:25,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897366255] [2022-03-18 21:38:25,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897366255] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 21:38:25,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780879758] [2022-03-18 21:38:25,521 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-18 21:38:25,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:38:25,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 21:38:25,522 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 21:38:25,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-18 21:38:25,596 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-18 21:38:25,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 21:38:25,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-18 21:38:25,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 21:38:25,648 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-18 21:38:25,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-18 21:38:25,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780879758] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 21:38:25,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-18 21:38:25,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-03-18 21:38:25,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177875952] [2022-03-18 21:38:25,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 21:38:25,649 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 21:38:25,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 21:38:25,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 21:38:25,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-18 21:38:25,650 INFO L87 Difference]: Start difference. First operand 134 states and 168 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:38:25,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 21:38:25,702 INFO L93 Difference]: Finished difference Result 225 states and 285 transitions. [2022-03-18 21:38:25,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 21:38:25,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-03-18 21:38:25,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 21:38:25,703 INFO L225 Difference]: With dead ends: 225 [2022-03-18 21:38:25,703 INFO L226 Difference]: Without dead ends: 134 [2022-03-18 21:38:25,703 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-18 21:38:25,704 INFO L912 BasicCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 21:38:25,704 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 54 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 21:38:25,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-03-18 21:38:25,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-03-18 21:38:25,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 125 states have (on average 1.272) internal successors, (159), 127 states have internal predecessors, (159), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-18 21:38:25,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 167 transitions. [2022-03-18 21:38:25,715 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 167 transitions. Word has length 37 [2022-03-18 21:38:25,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 21:38:25,715 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 167 transitions. [2022-03-18 21:38:25,715 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:38:25,715 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 167 transitions. [2022-03-18 21:38:25,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-18 21:38:25,715 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 21:38:25,716 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 21:38:25,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-18 21:38:25,933 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-18 21:38:25,933 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 21:38:25,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 21:38:25,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1404538378, now seen corresponding path program 1 times [2022-03-18 21:38:25,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 21:38:25,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486152723] [2022-03-18 21:38:25,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:38:25,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 21:38:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:38:25,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 21:38:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:38:25,992 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-18 21:38:25,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 21:38:25,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486152723] [2022-03-18 21:38:25,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486152723] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 21:38:25,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 21:38:25,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-18 21:38:25,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136802362] [2022-03-18 21:38:25,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 21:38:25,993 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-18 21:38:25,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 21:38:25,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-18 21:38:25,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-18 21:38:25,993 INFO L87 Difference]: Start difference. First operand 134 states and 167 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:38:26,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 21:38:26,076 INFO L93 Difference]: Finished difference Result 208 states and 260 transitions. [2022-03-18 21:38:26,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-18 21:38:26,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-03-18 21:38:26,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 21:38:26,077 INFO L225 Difference]: With dead ends: 208 [2022-03-18 21:38:26,077 INFO L226 Difference]: Without dead ends: 148 [2022-03-18 21:38:26,077 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-18 21:38:26,078 INFO L912 BasicCegarLoop]: 32 mSDtfsCounter, 83 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 21:38:26,078 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 44 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 21:38:26,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-03-18 21:38:26,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 134. [2022-03-18 21:38:26,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 125 states have (on average 1.264) internal successors, (158), 127 states have internal predecessors, (158), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-18 21:38:26,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 166 transitions. [2022-03-18 21:38:26,090 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 166 transitions. Word has length 37 [2022-03-18 21:38:26,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 21:38:26,090 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 166 transitions. [2022-03-18 21:38:26,090 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:38:26,090 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 166 transitions. [2022-03-18 21:38:26,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-03-18 21:38:26,091 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 21:38:26,091 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 21:38:26,091 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-18 21:38:26,091 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 21:38:26,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 21:38:26,091 INFO L85 PathProgramCache]: Analyzing trace with hash 179094910, now seen corresponding path program 1 times [2022-03-18 21:38:26,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 21:38:26,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433853298] [2022-03-18 21:38:26,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:38:26,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 21:38:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:38:26,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 21:38:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:38:26,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-18 21:38:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:38:26,218 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-18 21:38:26,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 21:38:26,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433853298] [2022-03-18 21:38:26,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433853298] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 21:38:26,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964820584] [2022-03-18 21:38:26,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:38:26,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:38:26,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 21:38:26,219 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 21:38:26,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-18 21:38:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:38:26,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-18 21:38:26,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 21:38:26,345 INFO L390 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 13 treesize of output 9 [2022-03-18 21:38:28,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-18 21:38:28,496 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-18 21:38:28,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 21:38:30,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-03-18 21:38:30,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-03-18 21:38:30,687 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-18 21:38:30,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964820584] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 21:38:30,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 21:38:30,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 28 [2022-03-18 21:38:30,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748455626] [2022-03-18 21:38:30,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 21:38:30,688 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-18 21:38:30,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 21:38:30,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-18 21:38:30,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=654, Unknown=2, NotChecked=0, Total=756 [2022-03-18 21:38:30,689 INFO L87 Difference]: Start difference. First operand 134 states and 166 transitions. Second operand has 28 states, 26 states have (on average 3.076923076923077) internal successors, (80), 25 states have internal predecessors, (80), 8 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-03-18 21:38:31,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 21:38:31,596 INFO L93 Difference]: Finished difference Result 297 states and 373 transitions. [2022-03-18 21:38:31,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-18 21:38:31,597 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.076923076923077) internal successors, (80), 25 states have internal predecessors, (80), 8 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 39 [2022-03-18 21:38:31,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 21:38:31,598 INFO L225 Difference]: With dead ends: 297 [2022-03-18 21:38:31,598 INFO L226 Difference]: Without dead ends: 295 [2022-03-18 21:38:31,599 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=436, Invalid=2532, Unknown=2, NotChecked=0, Total=2970 [2022-03-18 21:38:31,599 INFO L912 BasicCegarLoop]: 42 mSDtfsCounter, 434 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 249 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-18 21:38:31,599 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [434 Valid, 106 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 917 Invalid, 0 Unknown, 249 Unchecked, 0.4s Time] [2022-03-18 21:38:31,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-03-18 21:38:31,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 142. [2022-03-18 21:38:31,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 131 states have (on average 1.251908396946565) internal successors, (164), 133 states have internal predecessors, (164), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-18 21:38:31,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 174 transitions. [2022-03-18 21:38:31,614 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 174 transitions. Word has length 39 [2022-03-18 21:38:31,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 21:38:31,614 INFO L478 AbstractCegarLoop]: Abstraction has 142 states and 174 transitions. [2022-03-18 21:38:31,614 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.076923076923077) internal successors, (80), 25 states have internal predecessors, (80), 8 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-03-18 21:38:31,614 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2022-03-18 21:38:31,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-18 21:38:31,615 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 21:38:31,615 INFO L500 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 21:38:31,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-18 21:38:31,830 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-18 21:38:31,831 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 21:38:31,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 21:38:31,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1199172686, now seen corresponding path program 2 times [2022-03-18 21:38:31,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 21:38:31,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932960369] [2022-03-18 21:38:31,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:38:31,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 21:38:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:38:31,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 21:38:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:38:31,899 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 21:38:31,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 21:38:31,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932960369] [2022-03-18 21:38:31,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932960369] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 21:38:31,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918041022] [2022-03-18 21:38:31,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 21:38:31,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:38:31,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 21:38:31,901 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 21:38:31,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-18 21:38:31,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 21:38:31,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 21:38:31,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-18 21:38:31,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 21:38:32,090 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 21:38:32,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 21:38:32,149 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 21:38:32,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918041022] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 21:38:32,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 21:38:32,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-03-18 21:38:32,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019761084] [2022-03-18 21:38:32,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 21:38:32,150 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-18 21:38:32,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 21:38:32,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-18 21:38:32,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-03-18 21:38:32,151 INFO L87 Difference]: Start difference. First operand 142 states and 174 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:38:32,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 21:38:32,469 INFO L93 Difference]: Finished difference Result 312 states and 386 transitions. [2022-03-18 21:38:32,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-18 21:38:32,469 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-03-18 21:38:32,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 21:38:32,471 INFO L225 Difference]: With dead ends: 312 [2022-03-18 21:38:32,471 INFO L226 Difference]: Without dead ends: 283 [2022-03-18 21:38:32,471 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2022-03-18 21:38:32,472 INFO L912 BasicCegarLoop]: 56 mSDtfsCounter, 174 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-18 21:38:32,473 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 83 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-18 21:38:32,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-03-18 21:38:32,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 181. [2022-03-18 21:38:32,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 170 states have (on average 1.276470588235294) internal successors, (217), 172 states have internal predecessors, (217), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-18 21:38:32,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 227 transitions. [2022-03-18 21:38:32,499 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 227 transitions. Word has length 40 [2022-03-18 21:38:32,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 21:38:32,499 INFO L478 AbstractCegarLoop]: Abstraction has 181 states and 227 transitions. [2022-03-18 21:38:32,499 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:38:32,499 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 227 transitions. [2022-03-18 21:38:32,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-18 21:38:32,500 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 21:38:32,500 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 21:38:32,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-18 21:38:32,714 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-18 21:38:32,714 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 21:38:32,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 21:38:32,714 INFO L85 PathProgramCache]: Analyzing trace with hash -823687205, now seen corresponding path program 2 times [2022-03-18 21:38:32,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 21:38:32,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316455479] [2022-03-18 21:38:32,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:38:32,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 21:38:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:38:33,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 21:38:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:38:33,197 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-18 21:38:33,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 21:38:33,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316455479] [2022-03-18 21:38:33,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316455479] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 21:38:33,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504717313] [2022-03-18 21:38:33,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 21:38:33,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:38:33,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 21:38:33,199 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 21:38:33,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-18 21:38:33,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 21:38:33,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 21:38:33,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 40 conjunts are in the unsatisfiable core [2022-03-18 21:38:33,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 21:38:33,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-03-18 21:38:33,321 INFO L390 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 23 treesize of output 22 [2022-03-18 21:38:33,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 21:38:33,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-03-18 21:38:33,520 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-03-18 21:38:33,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-03-18 21:38:33,611 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-03-18 21:38:33,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-03-18 21:38:33,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-03-18 21:38:33,798 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-18 21:38:33,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 21:38:40,266 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 21:38:40,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504717313] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 21:38:40,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 21:38:40,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 16] total 39 [2022-03-18 21:38:40,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549695975] [2022-03-18 21:38:40,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 21:38:40,267 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-18 21:38:40,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 21:38:40,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-18 21:38:40,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1265, Unknown=6, NotChecked=0, Total=1482 [2022-03-18 21:38:40,268 INFO L87 Difference]: Start difference. First operand 181 states and 227 transitions. Second operand has 39 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 36 states have internal predecessors, (93), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:38:41,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 21:38:41,310 INFO L93 Difference]: Finished difference Result 404 states and 511 transitions. [2022-03-18 21:38:41,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-18 21:38:41,310 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 36 states have internal predecessors, (93), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-03-18 21:38:41,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 21:38:41,313 INFO L225 Difference]: With dead ends: 404 [2022-03-18 21:38:41,313 INFO L226 Difference]: Without dead ends: 402 [2022-03-18 21:38:41,314 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 80 SyntacticMatches, 9 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=650, Invalid=2884, Unknown=6, NotChecked=0, Total=3540 [2022-03-18 21:38:41,315 INFO L912 BasicCegarLoop]: 28 mSDtfsCounter, 326 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 591 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-18 21:38:41,315 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 102 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 813 Invalid, 0 Unknown, 591 Unchecked, 0.4s Time] [2022-03-18 21:38:41,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-03-18 21:38:41,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 274. [2022-03-18 21:38:41,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 263 states have (on average 1.3231939163498099) internal successors, (348), 265 states have internal predecessors, (348), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-18 21:38:41,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 358 transitions. [2022-03-18 21:38:41,365 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 358 transitions. Word has length 40 [2022-03-18 21:38:41,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 21:38:41,366 INFO L478 AbstractCegarLoop]: Abstraction has 274 states and 358 transitions. [2022-03-18 21:38:41,366 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 36 states have internal predecessors, (93), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:38:41,366 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 358 transitions. [2022-03-18 21:38:41,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-18 21:38:41,366 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 21:38:41,366 INFO L500 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 21:38:41,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-18 21:38:41,573 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-18 21:38:41,574 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 21:38:41,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 21:38:41,574 INFO L85 PathProgramCache]: Analyzing trace with hash -945679404, now seen corresponding path program 3 times [2022-03-18 21:38:41,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 21:38:41,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572270342] [2022-03-18 21:38:41,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:38:41,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 21:38:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:38:42,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 21:38:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:38:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-18 21:38:42,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 21:38:42,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572270342] [2022-03-18 21:38:42,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572270342] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 21:38:42,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475041318] [2022-03-18 21:38:42,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-18 21:38:42,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:38:42,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 21:38:42,209 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 21:38:42,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-18 21:38:42,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-18 21:38:42,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 21:38:42,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-18 21:38:42,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 21:38:42,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-03-18 21:38:42,460 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-18 21:38:42,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 21:38:42,463 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-18 21:38:42,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 42 [2022-03-18 21:38:42,755 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-18 21:38:42,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 21:38:42,770 INFO L356 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2022-03-18 21:38:42,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 59 [2022-03-18 21:38:43,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 21:38:43,117 INFO L356 Elim1Store]: treesize reduction 238, result has 26.8 percent of original size [2022-03-18 21:38:43,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 4 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 23 case distinctions, treesize of input 88 treesize of output 159 [2022-03-18 21:38:56,149 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-03-18 21:38:56,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 29 [2022-03-18 21:38:56,229 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-18 21:38:56,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 21:38:57,827 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_640 Int) (main_~j~0 Int) (v_ArrVal_639 Int) (v_main_~x~0_39 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* 4 c_main_~x~0) |c_main_~#distance~0.offset|) v_ArrVal_639)) (.cse1 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|))) (or (not (<= 0 (+ v_ArrVal_639 1))) (<= (select .cse0 .cse1) (let ((.cse2 (store |c_#memory_int| |c_main_~#distance~0.base| .cse0)) (.cse3 (* main_~j~0 4))) (+ (select (select .cse2 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse3)) (select .cse0 (+ (* (select (select .cse2 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse3)) 4) |c_main_~#distance~0.offset|))))) (<= 3 main_~j~0) (<= main_~j~0 1) (<= 0 (select (store .cse0 .cse1 v_ArrVal_640) |c_main_~#distance~0.offset|))))) is different from false [2022-03-18 21:38:58,798 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_639)) (.cse1 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|))) (or (<= (select .cse0 .cse1) (let ((.cse2 (store |c_#memory_int| |c_main_~#distance~0.base| .cse0)) (.cse3 (* v_main_~j~0_53 4))) (+ (select .cse0 (+ (* (select (select .cse2 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse3)) 4) |c_main_~#distance~0.offset|)) (select (select .cse2 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse3))))) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= 0 (select (store .cse0 .cse1 v_ArrVal_640) |c_main_~#distance~0.offset|)) (<= 3 v_main_~j~0_53)))) is different from false [2022-03-18 21:38:59,961 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (let ((.cse1 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|)) (.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 4)) v_ArrVal_639))) (or (<= 0 (select (store .cse0 .cse1 v_ArrVal_640) |c_main_~#distance~0.offset|)) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= (select .cse0 .cse1) (let ((.cse2 (store |c_#memory_int| |c_main_~#distance~0.base| .cse0)) (.cse3 (* v_main_~j~0_53 4))) (+ (select (select .cse2 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse3)) (select .cse0 (+ (* (select (select .cse2 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse3)) 4) |c_main_~#distance~0.offset|))))) (<= 3 v_main_~j~0_53)))) is different from false [2022-03-18 21:39:07,737 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2022-03-18 21:39:07,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475041318] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 21:39:07,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 21:39:07,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22, 21] total 55 [2022-03-18 21:39:07,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866587631] [2022-03-18 21:39:07,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 21:39:07,738 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-03-18 21:39:07,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 21:39:07,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-03-18 21:39:07,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=2258, Unknown=6, NotChecked=306, Total=2970 [2022-03-18 21:39:07,739 INFO L87 Difference]: Start difference. First operand 274 states and 358 transitions. Second operand has 55 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 52 states have internal predecessors, (101), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:39:08,608 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|)) (.cse1 (select |c_#memory_int| |c_main_~#distance~0.base|))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (= |c_main_~#Source~0.offset| 0) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (= (select .cse0 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (not (= |c_main_~#distance~0.base| |c_main_~#Weight~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= (select .cse1 |c_main_~#distance~0.offset|) 0) (forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (let ((.cse3 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|)) (.cse2 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 4)) v_ArrVal_639))) (or (<= 0 (select (store .cse2 .cse3 v_ArrVal_640) |c_main_~#distance~0.offset|)) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= (select .cse2 .cse3) (let ((.cse4 (store |c_#memory_int| |c_main_~#distance~0.base| .cse2)) (.cse5 (* v_main_~j~0_53 4))) (+ (select (select .cse4 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse5)) (select .cse2 (+ (* (select (select .cse4 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse5)) 4) |c_main_~#distance~0.offset|))))) (<= 3 v_main_~j~0_53)))) (= c_main_~i~0 0) (= (select .cse1 (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|)) 0) (not (= |c_main_~#distance~0.base| |c_main_~#Source~0.base|)) (= |c_main_~#Weight~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| 8)) 1) (<= 2 (select (select |c_#memory_int| |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| 8))) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-03-18 21:39:09,360 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|)) (.cse1 (select |c_#memory_int| |c_main_~#distance~0.base|))) (and (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (= |c_main_~#Source~0.offset| 0) (= |c_main_~#distance~0.offset| 0) (= (select .cse0 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Weight~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= (select .cse1 |c_main_~#distance~0.offset|) 0) (= (select .cse1 0) 0) (forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (let ((.cse3 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|)) (.cse2 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 4)) v_ArrVal_639))) (or (<= 0 (select (store .cse2 .cse3 v_ArrVal_640) |c_main_~#distance~0.offset|)) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= (select .cse2 .cse3) (let ((.cse4 (store |c_#memory_int| |c_main_~#distance~0.base| .cse2)) (.cse5 (* v_main_~j~0_53 4))) (+ (select (select .cse4 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse5)) (select .cse2 (+ (* (select (select .cse4 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse5)) 4) |c_main_~#distance~0.offset|))))) (<= 3 v_main_~j~0_53)))) (not (= |c_main_~#distance~0.base| |c_main_~#Source~0.base|)) (= |c_main_~#Weight~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| 8)) 1) (<= 2 (select (select |c_#memory_int| |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| 8))))) is different from false [2022-03-18 21:39:10,201 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_main_~#distance~0.base|)) (.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|)) (.cse1 (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|))) (and (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (= |c_main_~#Source~0.offset| 0) (= .cse1 0) (= |c_main_~#distance~0.offset| 0) (= (select .cse0 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Weight~0.base|)) (= |c_main_~#Dest~0.offset| 0) (forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_639)) (.cse3 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|))) (or (<= (select .cse2 .cse3) (let ((.cse4 (store |c_#memory_int| |c_main_~#distance~0.base| .cse2)) (.cse5 (* v_main_~j~0_53 4))) (+ (select .cse2 (+ (* (select (select .cse4 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse5)) 4) |c_main_~#distance~0.offset|)) (select (select .cse4 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse5))))) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= 0 (select (store .cse2 .cse3 v_ArrVal_640) |c_main_~#distance~0.offset|)) (<= 3 v_main_~j~0_53)))) (= (select .cse6 |c_main_~#distance~0.offset|) 0) (= (select .cse6 0) 0) (= (select .cse0 .cse1) 1) (not (= |c_main_~#distance~0.base| |c_main_~#Source~0.base|)) (= |c_main_~#Weight~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| 8)) 1) (<= 2 (select (select |c_#memory_int| |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| 8))) (= c_main_~j~0 0))) is different from false [2022-03-18 21:39:10,960 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (let ((.cse0 (select .cse1 |c_main_~#Dest~0.offset|)) (.cse2 (select |c_#memory_int| |c_main_~#distance~0.base|))) (and (= .cse0 1) (= |c_main_~#Source~0.offset| 0) (= (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|) 0) (= |c_main_~#distance~0.offset| 0) (= .cse0 c_main_~x~0) (= (select .cse1 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (not (= |c_main_~#distance~0.base| |c_main_~#Weight~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= (select .cse2 |c_main_~#distance~0.offset|) 0) (= (select .cse2 0) 0) (not (= |c_main_~#distance~0.base| |c_main_~#Source~0.base|)) (forall ((v_ArrVal_640 Int) (main_~j~0 Int) (v_ArrVal_639 Int) (v_main_~x~0_39 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* 4 c_main_~x~0) |c_main_~#distance~0.offset|) v_ArrVal_639)) (.cse4 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|))) (or (not (<= 0 (+ v_ArrVal_639 1))) (<= (select .cse3 .cse4) (let ((.cse5 (store |c_#memory_int| |c_main_~#distance~0.base| .cse3)) (.cse6 (* main_~j~0 4))) (+ (select (select .cse5 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse6)) (select .cse3 (+ (* (select (select .cse5 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse6)) 4) |c_main_~#distance~0.offset|))))) (<= 3 main_~j~0) (<= main_~j~0 1) (<= 0 (select (store .cse3 .cse4 v_ArrVal_640) |c_main_~#distance~0.offset|))))) (= |c_main_~#Weight~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| 8)) 1) (<= 2 (select (select |c_#memory_int| |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| 8))) (= (+ (- 1) c_main_~x~0) 0) (= c_main_~j~0 0)))) is different from false [2022-03-18 21:39:13,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 21:39:13,949 INFO L93 Difference]: Finished difference Result 376 states and 480 transitions. [2022-03-18 21:39:13,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-03-18 21:39:13,950 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 52 states have internal predecessors, (101), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-03-18 21:39:13,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 21:39:13,951 INFO L225 Difference]: With dead ends: 376 [2022-03-18 21:39:13,951 INFO L226 Difference]: Without dead ends: 347 [2022-03-18 21:39:13,953 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 110 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2783 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=1572, Invalid=9366, Unknown=10, NotChecked=1484, Total=12432 [2022-03-18 21:39:13,953 INFO L912 BasicCegarLoop]: 41 mSDtfsCounter, 151 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 2001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1023 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-18 21:39:13,954 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 139 Invalid, 2001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 885 Invalid, 0 Unknown, 1023 Unchecked, 0.4s Time] [2022-03-18 21:39:13,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-03-18 21:39:13,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 291. [2022-03-18 21:39:13,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 280 states have (on average 1.3178571428571428) internal successors, (369), 282 states have internal predecessors, (369), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-18 21:39:13,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 379 transitions. [2022-03-18 21:39:13,985 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 379 transitions. Word has length 43 [2022-03-18 21:39:13,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 21:39:13,985 INFO L478 AbstractCegarLoop]: Abstraction has 291 states and 379 transitions. [2022-03-18 21:39:13,986 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 52 states have internal predecessors, (101), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:39:13,986 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 379 transitions. [2022-03-18 21:39:13,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-18 21:39:13,986 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 21:39:13,986 INFO L500 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 21:39:14,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-18 21:39:14,194 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:39:14,194 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 21:39:14,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 21:39:14,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1200415949, now seen corresponding path program 4 times [2022-03-18 21:39:14,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 21:39:14,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818580125] [2022-03-18 21:39:14,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:39:14,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 21:39:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:39:14,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 21:39:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:39:14,550 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-18 21:39:14,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 21:39:14,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818580125] [2022-03-18 21:39:14,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818580125] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 21:39:14,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774854642] [2022-03-18 21:39:14,550 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-18 21:39:14,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:39:14,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 21:39:14,564 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-03-18 21:39:14,571 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-03-18 21:39:14,713 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-18 21:39:14,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 21:39:14,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-18 21:39:14,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 21:39:14,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-03-18 21:39:14,772 INFO L390 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 25 treesize of output 24 [2022-03-18 21:39:15,165 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-03-18 21:39:15,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2022-03-18 21:39:29,789 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-03-18 21:39:29,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 13 [2022-03-18 21:39:29,847 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-18 21:39:29,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 21:39:44,787 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-18 21:39:44,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774854642] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 21:39:44,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 21:39:44,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 19] total 46 [2022-03-18 21:39:44,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460648851] [2022-03-18 21:39:44,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 21:39:44,788 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-18 21:39:44,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 21:39:44,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-18 21:39:44,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1781, Unknown=19, NotChecked=0, Total=2070 [2022-03-18 21:39:44,789 INFO L87 Difference]: Start difference. First operand 291 states and 379 transitions. Second operand has 46 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:39:50,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 21:39:50,609 INFO L93 Difference]: Finished difference Result 320 states and 410 transitions. [2022-03-18 21:39:50,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-18 21:39:50,609 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-03-18 21:39:50,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 21:39:50,610 INFO L225 Difference]: With dead ends: 320 [2022-03-18 21:39:50,610 INFO L226 Difference]: Without dead ends: 298 [2022-03-18 21:39:50,611 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 46 SyntacticMatches, 16 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1555 ImplicationChecksByTransitivity, 34.7s TimeCoverageRelationStatistics Valid=642, Invalid=3891, Unknown=23, NotChecked=0, Total=4556 [2022-03-18 21:39:50,612 INFO L912 BasicCegarLoop]: 44 mSDtfsCounter, 115 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 782 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 21:39:50,612 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 212 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 381 Invalid, 0 Unknown, 782 Unchecked, 0.1s Time] [2022-03-18 21:39:50,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-03-18 21:39:50,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2022-03-18 21:39:50,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 283 states have (on average 1.3180212014134276) internal successors, (373), 285 states have internal predecessors, (373), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-18 21:39:50,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 383 transitions. [2022-03-18 21:39:50,644 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 383 transitions. Word has length 43 [2022-03-18 21:39:50,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 21:39:50,644 INFO L478 AbstractCegarLoop]: Abstraction has 294 states and 383 transitions. [2022-03-18 21:39:50,645 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:39:50,645 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 383 transitions. [2022-03-18 21:39:50,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-18 21:39:50,645 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 21:39:50,645 INFO L500 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 21:39:50,662 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-03-18 21:39:50,854 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:39:50,855 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 21:39:50,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 21:39:50,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1761847362, now seen corresponding path program 3 times [2022-03-18 21:39:50,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 21:39:50,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791552614] [2022-03-18 21:39:50,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:39:50,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 21:39:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:39:50,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 21:39:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:39:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-18 21:39:50,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 21:39:50,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791552614] [2022-03-18 21:39:50,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791552614] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 21:39:50,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206939231] [2022-03-18 21:39:50,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-18 21:39:50,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:39:50,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 21:39:50,924 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-03-18 21:39:50,925 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-03-18 21:39:51,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-18 21:39:51,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 21:39:51,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-18 21:39:51,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 21:39:51,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-03-18 21:39:51,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 21:39:51,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-03-18 21:39:51,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 21:39:51,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 21:39:51,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-18 21:39:51,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 21:39:51,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 21:39:51,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-18 21:39:51,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-18 21:39:51,421 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-03-18 21:39:51,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2022-03-18 21:39:51,531 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-03-18 21:39:51,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2022-03-18 21:39:52,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-03-18 21:39:52,475 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-18 21:39:52,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 21:40:01,849 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0_52 Int)) (or (forall ((v_ArrVal_742 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |c_main_~#distance~0.offset|) v_ArrVal_742))) (store .cse0 (+ (* 4 (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse0) |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|))) |c_main_~#distance~0.offset|) v_ArrVal_744)) |c_main_~#distance~0.offset|)))) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) v_main_~x~0_52)))) is different from false [2022-03-18 21:40:02,695 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |c_main_~#distance~0.offset|) v_ArrVal_742))) (store .cse0 (+ (* 4 (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse0) |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|))) |c_main_~#distance~0.offset|) v_ArrVal_744)) |c_main_~#distance~0.offset|)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_52)))) is different from false [2022-03-18 21:40:48,664 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_151 Int)) (or (forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741))) (or (<= (+ main_~j~0 1) 0) (not (<= (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse0) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_52)) (<= 1 main_~j~0) (<= 0 (select (let ((.cse1 (store .cse0 (+ (* v_main_~x~0_52 4) |c_main_~#distance~0.offset|) v_ArrVal_742))) (store .cse1 (+ (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse1) |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_744)) |c_main_~#distance~0.offset|))))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_151)))) is different from false [2022-03-18 21:40:50,757 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_main_~i~0_151 Int) (v_ArrVal_739 Int) (v_ArrVal_744 Int)) (let ((.cse1 (store (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|) v_ArrVal_739) (+ |c_main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741))) (or (<= 0 (select (let ((.cse0 (store .cse1 (+ (* v_main_~x~0_52 4) |c_main_~#distance~0.offset|) v_ArrVal_742))) (store .cse0 (+ |c_main_~#distance~0.offset| (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse0) |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|)) 4)) v_ArrVal_744)) |c_main_~#distance~0.offset|)) (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (not (<= (+ c_main_~i~0 1) v_main_~i~0_151)) (not (<= (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse1) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_52))))) is different from false [2022-03-18 21:40:53,083 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_152 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_152)) (forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_main_~i~0_151 Int) (v_ArrVal_739 Int) (v_ArrVal_744 Int)) (let ((.cse0 (store (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* 4 v_main_~i~0_152) |c_main_~#distance~0.offset|) v_ArrVal_739) (+ |c_main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741))) (or (<= (+ main_~j~0 1) 0) (not (<= (+ v_main_~i~0_152 1) v_main_~i~0_151)) (<= 1 main_~j~0) (not (<= (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse0) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_52)) (<= 0 (select (let ((.cse1 (store .cse0 (+ (* v_main_~x~0_52 4) |c_main_~#distance~0.offset|) v_ArrVal_742))) (store .cse1 (+ (* 4 (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse1) |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|))) |c_main_~#distance~0.offset|) v_ArrVal_744)) |c_main_~#distance~0.offset|))))))) is different from false [2022-03-18 21:41:23,834 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 7 refuted. 2 times theorem prover too weak. 1 trivial. 15 not checked. [2022-03-18 21:41:23,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206939231] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 21:41:23,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 21:41:23,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 21, 23] total 47 [2022-03-18 21:41:23,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335142763] [2022-03-18 21:41:23,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 21:41:23,835 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-18 21:41:23,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 21:41:23,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-18 21:41:23,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1431, Unknown=40, NotChecked=420, Total=2162 [2022-03-18 21:41:23,836 INFO L87 Difference]: Start difference. First operand 294 states and 383 transitions. Second operand has 47 states, 46 states have (on average 2.3043478260869565) internal successors, (106), 45 states have internal predecessors, (106), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:41:25,913 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (forall ((v_main_~i~0_152 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_152)) (forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_main_~i~0_151 Int) (v_ArrVal_739 Int) (v_ArrVal_744 Int)) (let ((.cse1 (store (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* 4 v_main_~i~0_152) |c_main_~#distance~0.offset|) v_ArrVal_739) (+ |c_main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741))) (or (<= (+ main_~j~0 1) 0) (not (<= (+ v_main_~i~0_152 1) v_main_~i~0_151)) (<= 1 main_~j~0) (not (<= (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse1) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_52)) (<= 0 (select (let ((.cse2 (store .cse1 (+ (* v_main_~x~0_52 4) |c_main_~#distance~0.offset|) v_ArrVal_742))) (store .cse2 (+ (* 4 (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse2) |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|))) |c_main_~#distance~0.offset|) v_ArrVal_744)) |c_main_~#distance~0.offset|))))))) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= (select .cse0 (+ 40 |c_main_~#Dest~0.offset|)) 0) (<= (+ c_main_~i~0 1) c_main_~nodecount~0) (= |c_main_~#Dest~0.offset| 0) (= c_main_~i~0 0) (<= 0 (select (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|))) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-03-18 21:41:27,058 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (and (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (<= 1 c_main_~i~0) (= |c_main_~#distance~0.offset| 0) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= (select .cse0 (+ 40 |c_main_~#Dest~0.offset|)) 0) (= |c_main_~#Dest~0.offset| 0) (forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_main_~i~0_151 Int) (v_ArrVal_739 Int) (v_ArrVal_744 Int)) (let ((.cse2 (store (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|) v_ArrVal_739) (+ |c_main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741))) (or (<= 0 (select (let ((.cse1 (store .cse2 (+ (* v_main_~x~0_52 4) |c_main_~#distance~0.offset|) v_ArrVal_742))) (store .cse1 (+ |c_main_~#distance~0.offset| (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse1) |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|)) 4)) v_ArrVal_744)) |c_main_~#distance~0.offset|)) (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (not (<= (+ c_main_~i~0 1) v_main_~i~0_151)) (not (<= (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse2) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_52))))) (<= 0 (select (select |c_#memory_int| |c_main_~#distance~0.base|) |c_main_~#distance~0.offset|)))) is different from false [2022-03-18 21:41:29,085 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (and (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (<= 1 c_main_~i~0) (= |c_main_~#distance~0.offset| 0) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= (select .cse0 (+ 40 |c_main_~#Dest~0.offset|)) 0) (= |c_main_~#Dest~0.offset| 0) (forall ((v_main_~i~0_151 Int)) (or (forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741))) (or (<= (+ main_~j~0 1) 0) (not (<= (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse1) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_52)) (<= 1 main_~j~0) (<= 0 (select (let ((.cse2 (store .cse1 (+ (* v_main_~x~0_52 4) |c_main_~#distance~0.offset|) v_ArrVal_742))) (store .cse2 (+ (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse2) |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_744)) |c_main_~#distance~0.offset|))))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_151)))) (<= 0 (select (select |c_#memory_int| |c_main_~#distance~0.base|) |c_main_~#distance~0.offset|)))) is different from false [2022-03-18 21:41:29,885 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (<= 2 c_main_~i~0) (= (select .cse0 (+ 40 |c_main_~#Dest~0.offset|)) 0) (<= (+ c_main_~i~0 1) c_main_~nodecount~0) (= |c_main_~#Dest~0.offset| 0) (forall ((v_ArrVal_742 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (let ((.cse1 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |c_main_~#distance~0.offset|) v_ArrVal_742))) (store .cse1 (+ (* 4 (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse1) |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|))) |c_main_~#distance~0.offset|) v_ArrVal_744)) |c_main_~#distance~0.offset|)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_52)))) (<= 3 c_main_~nodecount~0) (<= 0 (select (select |c_#memory_int| |c_main_~#distance~0.base|) |c_main_~#distance~0.offset|)) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-03-18 21:41:30,650 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (and (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (<= 2 c_main_~i~0) (= (select .cse0 (+ 40 |c_main_~#Dest~0.offset|)) 0) (= |c_main_~#Dest~0.offset| 0) (forall ((v_ArrVal_742 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (let ((.cse1 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |c_main_~#distance~0.offset|) v_ArrVal_742))) (store .cse1 (+ (* 4 (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse1) |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|))) |c_main_~#distance~0.offset|) v_ArrVal_744)) |c_main_~#distance~0.offset|)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_52)))) (<= 3 c_main_~nodecount~0) (<= 0 (select (select |c_#memory_int| |c_main_~#distance~0.base|) |c_main_~#distance~0.offset|)))) is different from false [2022-03-18 21:41:31,405 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (and (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= (select .cse0 (+ 40 |c_main_~#Dest~0.offset|)) 0) (= |c_main_~#Dest~0.offset| 0) (forall ((v_ArrVal_742 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (let ((.cse1 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |c_main_~#distance~0.offset|) v_ArrVal_742))) (store .cse1 (+ (* 4 (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse1) |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|))) |c_main_~#distance~0.offset|) v_ArrVal_744)) |c_main_~#distance~0.offset|)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_52)))) (<= 3 c_main_~nodecount~0) (<= 0 (select (select |c_#memory_int| |c_main_~#distance~0.base|) |c_main_~#distance~0.offset|)))) is different from false [2022-03-18 21:41:32,140 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= (select .cse0 (+ 40 |c_main_~#Dest~0.offset|)) 0) (= |c_main_~#Dest~0.offset| 0) (= c_main_~i~0 0) (forall ((v_ArrVal_742 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (let ((.cse1 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |c_main_~#distance~0.offset|) v_ArrVal_742))) (store .cse1 (+ (* 4 (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse1) |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|))) |c_main_~#distance~0.offset|) v_ArrVal_744)) |c_main_~#distance~0.offset|)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_52)))) (<= 3 c_main_~nodecount~0) (<= 0 (select (select |c_#memory_int| |c_main_~#distance~0.base|) |c_main_~#distance~0.offset|)) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-03-18 21:41:32,842 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (<= 2 c_main_~i~0) (= (select .cse0 (+ 40 |c_main_~#Dest~0.offset|)) 0) (= |c_main_~#Dest~0.offset| 0) (forall ((v_ArrVal_742 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (let ((.cse1 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |c_main_~#distance~0.offset|) v_ArrVal_742))) (store .cse1 (+ (* 4 (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse1) |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|))) |c_main_~#distance~0.offset|) v_ArrVal_744)) |c_main_~#distance~0.offset|)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_52)))) (<= 3 c_main_~nodecount~0) (<= 0 (select (select |c_#memory_int| |c_main_~#distance~0.base|) |c_main_~#distance~0.offset|)) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-03-18 21:41:34,927 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (and (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= (select .cse0 (+ 40 |c_main_~#Dest~0.offset|)) 0) (= |c_main_~#Dest~0.offset| 0) (= c_main_~i~0 0) (forall ((v_main_~x~0_52 Int)) (or (forall ((v_ArrVal_742 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (let ((.cse1 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |c_main_~#distance~0.offset|) v_ArrVal_742))) (store .cse1 (+ (* 4 (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse1) |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|))) |c_main_~#distance~0.offset|) v_ArrVal_744)) |c_main_~#distance~0.offset|)))) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) v_main_~x~0_52)))) (<= 3 c_main_~nodecount~0) (<= 0 (select (select |c_#memory_int| |c_main_~#distance~0.base|) |c_main_~#distance~0.offset|)) (= c_main_~j~0 0))) is different from false [2022-03-18 21:41:36,910 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (<= 1 c_main_~i~0) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= (select .cse0 (+ 40 |c_main_~#Dest~0.offset|)) 0) (= |c_main_~#Dest~0.offset| 0) (< c_main_~j~0 c_main_~edgecount~0) (forall ((v_ArrVal_742 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= 0 (select (let ((.cse1 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* 4 c_main_~x~0) |c_main_~#distance~0.offset|) v_ArrVal_742))) (store .cse1 (+ (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse1) |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_744)) |c_main_~#distance~0.offset|)) (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0))) (<= (+ c_main_~i~0 2) c_main_~nodecount~0) (exists ((|main_~#Dest~0.base| Int)) (let ((.cse2 (select |c_#memory_int| |main_~#Dest~0.base|))) (and (= (select .cse2 40) 0) (= (select .cse2 0) 1) (= c_main_~x~0 (select .cse2 (* c_main_~j~0 4))) (not (= |main_~#Dest~0.base| |c_main_~#distance~0.base|))))) (<= 3 c_main_~nodecount~0) (<= 0 (select (select |c_#memory_int| |c_main_~#distance~0.base|) |c_main_~#distance~0.offset|)) (= c_main_~j~0 0) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-03-18 21:41:37,897 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (exists ((|main_~#Dest~0.base| Int)) (let ((.cse1 (select |c_#memory_int| |main_~#Dest~0.base|))) (and (= (select .cse1 40) 0) (= (select .cse1 0) 1) (not (= |main_~#Dest~0.base| |c_main_~#distance~0.base|))))) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (exists ((|main_~#Dest~0.base| Int) (v_main_~j~0_63 Int)) (let ((.cse2 (select |c_#memory_int| |main_~#Dest~0.base|))) (and (or (= (+ |c_main_~#distance~0.offset| (* 4 (select .cse2 (* v_main_~j~0_63 4)))) |c_main_~#distance~0.offset|) (<= 0 (select (select |c_#memory_int| |c_main_~#distance~0.base|) |c_main_~#distance~0.offset|))) (= (select .cse2 40) 0) (< v_main_~j~0_63 c_main_~edgecount~0) (= (select .cse2 0) 1) (<= c_main_~edgecount~0 (+ v_main_~j~0_63 1)) (not (= |main_~#Dest~0.base| |c_main_~#distance~0.base|))))) (= (select .cse0 (+ 40 |c_main_~#Dest~0.offset|)) 0) (= |c_main_~#Dest~0.offset| 0) (= c_main_~i~0 0) (<= 0 (select (select |c_#memory_int| |c_main_~#distance~0.base|) |c_main_~#distance~0.offset|)) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (forall ((main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* 4 (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|))) |c_main_~#distance~0.offset|) v_ArrVal_744) |c_main_~#distance~0.offset|)))))) is different from false [2022-03-18 21:41:46,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 21:41:46,597 INFO L93 Difference]: Finished difference Result 1022 states and 1333 transitions. [2022-03-18 21:41:46,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2022-03-18 21:41:46,597 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.3043478260869565) internal successors, (106), 45 states have internal predecessors, (106), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-03-18 21:41:46,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 21:41:46,600 INFO L225 Difference]: With dead ends: 1022 [2022-03-18 21:41:46,600 INFO L226 Difference]: Without dead ends: 969 [2022-03-18 21:41:46,607 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 74 SyntacticMatches, 12 SemanticMatches, 178 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 10088 ImplicationChecksByTransitivity, 112.2s TimeCoverageRelationStatistics Valid=3500, Invalid=23242, Unknown=54, NotChecked=5424, Total=32220 [2022-03-18 21:41:46,615 INFO L912 BasicCegarLoop]: 49 mSDtfsCounter, 344 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 3802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2300 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-18 21:41:46,615 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [344 Valid, 238 Invalid, 3802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 1326 Invalid, 0 Unknown, 2300 Unchecked, 0.6s Time] [2022-03-18 21:41:46,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2022-03-18 21:41:46,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 362. [2022-03-18 21:41:46,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 351 states have (on average 1.3276353276353277) internal successors, (466), 353 states have internal predecessors, (466), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-18 21:41:46,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 476 transitions. [2022-03-18 21:41:46,710 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 476 transitions. Word has length 43 [2022-03-18 21:41:46,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 21:41:46,710 INFO L478 AbstractCegarLoop]: Abstraction has 362 states and 476 transitions. [2022-03-18 21:41:46,710 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.3043478260869565) internal successors, (106), 45 states have internal predecessors, (106), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:41:46,710 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 476 transitions. [2022-03-18 21:41:46,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-03-18 21:41:46,711 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 21:41:46,711 INFO L500 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 21:41:46,728 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-03-18 21:41:46,924 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:41:46,925 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 21:41:46,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 21:41:46,925 INFO L85 PathProgramCache]: Analyzing trace with hash -584884781, now seen corresponding path program 2 times [2022-03-18 21:41:46,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 21:41:46,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096527055] [2022-03-18 21:41:46,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:41:46,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 21:41:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:41:46,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 21:41:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:41:46,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-18 21:41:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:41:46,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-03-18 21:41:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:41:47,001 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-18 21:41:47,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 21:41:47,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096527055] [2022-03-18 21:41:47,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096527055] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 21:41:47,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138470712] [2022-03-18 21:41:47,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 21:41:47,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:41:47,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 21:41:47,003 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-03-18 21:41:47,032 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-03-18 21:41:47,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 21:41:47,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 21:41:47,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-18 21:41:47,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 21:41:47,224 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-18 21:41:47,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 21:41:47,302 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-18 21:41:47,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138470712] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 21:41:47,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 21:41:47,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-03-18 21:41:47,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798497299] [2022-03-18 21:41:47,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 21:41:47,303 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-18 21:41:47,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 21:41:47,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-18 21:41:47,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-03-18 21:41:47,303 INFO L87 Difference]: Start difference. First operand 362 states and 476 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-18 21:41:47,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 21:41:47,694 INFO L93 Difference]: Finished difference Result 708 states and 910 transitions. [2022-03-18 21:41:47,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-18 21:41:47,694 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2022-03-18 21:41:47,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 21:41:47,696 INFO L225 Difference]: With dead ends: 708 [2022-03-18 21:41:47,696 INFO L226 Difference]: Without dead ends: 528 [2022-03-18 21:41:47,697 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2022-03-18 21:41:47,697 INFO L912 BasicCegarLoop]: 39 mSDtfsCounter, 286 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-18 21:41:47,697 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 76 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-18 21:41:47,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-03-18 21:41:47,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 396. [2022-03-18 21:41:47,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 383 states have (on average 1.2976501305483028) internal successors, (497), 386 states have internal predecessors, (497), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-18 21:41:47,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 511 transitions. [2022-03-18 21:41:47,772 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 511 transitions. Word has length 47 [2022-03-18 21:41:47,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 21:41:47,772 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 511 transitions. [2022-03-18 21:41:47,772 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-18 21:41:47,772 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 511 transitions. [2022-03-18 21:41:47,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-18 21:41:47,773 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 21:41:47,773 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 21:41:47,791 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-03-18 21:41:47,991 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:41:47,991 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 21:41:47,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 21:41:47,991 INFO L85 PathProgramCache]: Analyzing trace with hash 2040872352, now seen corresponding path program 5 times [2022-03-18 21:41:47,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 21:41:47,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239469187] [2022-03-18 21:41:47,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:41:47,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 21:41:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:41:48,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 21:41:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:41:48,087 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 21:41:48,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 21:41:48,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239469187] [2022-03-18 21:41:48,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239469187] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 21:41:48,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614322752] [2022-03-18 21:41:48,087 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-18 21:41:48,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:41:48,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 21:41:48,088 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-03-18 21:41:48,137 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-03-18 21:41:48,329 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-18 21:41:48,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 21:41:48,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-18 21:41:48,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 21:41:48,410 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 21:41:48,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 21:41:48,457 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 21:41:48,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614322752] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 21:41:48,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 21:41:48,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-03-18 21:41:48,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725896250] [2022-03-18 21:41:48,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 21:41:48,458 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-18 21:41:48,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 21:41:48,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-18 21:41:48,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-03-18 21:41:48,458 INFO L87 Difference]: Start difference. First operand 396 states and 511 transitions. Second operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:41:48,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 21:41:48,982 INFO L93 Difference]: Finished difference Result 900 states and 1145 transitions. [2022-03-18 21:41:48,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-18 21:41:48,982 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-03-18 21:41:48,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 21:41:48,985 INFO L225 Difference]: With dead ends: 900 [2022-03-18 21:41:48,985 INFO L226 Difference]: Without dead ends: 863 [2022-03-18 21:41:48,986 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=292, Invalid=898, Unknown=0, NotChecked=0, Total=1190 [2022-03-18 21:41:48,986 INFO L912 BasicCegarLoop]: 68 mSDtfsCounter, 178 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-18 21:41:48,986 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 105 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-18 21:41:48,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2022-03-18 21:41:49,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 503. [2022-03-18 21:41:49,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 490 states have (on average 1.3285714285714285) internal successors, (651), 493 states have internal predecessors, (651), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-18 21:41:49,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 665 transitions. [2022-03-18 21:41:49,071 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 665 transitions. Word has length 46 [2022-03-18 21:41:49,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 21:41:49,072 INFO L478 AbstractCegarLoop]: Abstraction has 503 states and 665 transitions. [2022-03-18 21:41:49,072 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:41:49,072 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 665 transitions. [2022-03-18 21:41:49,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-18 21:41:49,072 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 21:41:49,073 INFO L500 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 21:41:49,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-18 21:41:49,291 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:41:49,291 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 21:41:49,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 21:41:49,292 INFO L85 PathProgramCache]: Analyzing trace with hash 640274542, now seen corresponding path program 4 times [2022-03-18 21:41:49,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 21:41:49,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069542879] [2022-03-18 21:41:49,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:41:49,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 21:41:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:41:49,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 21:41:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:41:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-18 21:41:49,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 21:41:49,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069542879] [2022-03-18 21:41:49,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069542879] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 21:41:49,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587311994] [2022-03-18 21:41:49,342 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-18 21:41:49,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:41:49,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 21:41:49,343 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-03-18 21:41:49,351 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-03-18 21:41:49,423 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-18 21:41:49,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 21:41:49,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-18 21:41:49,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 21:41:49,500 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-18 21:41:49,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 21:41:49,568 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-18 21:41:49,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587311994] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 21:41:49,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 21:41:49,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-03-18 21:41:49,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771233735] [2022-03-18 21:41:49,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 21:41:49,569 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-18 21:41:49,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 21:41:49,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-18 21:41:49,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-03-18 21:41:49,569 INFO L87 Difference]: Start difference. First operand 503 states and 665 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:41:49,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 21:41:49,940 INFO L93 Difference]: Finished difference Result 985 states and 1271 transitions. [2022-03-18 21:41:49,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-18 21:41:49,940 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-03-18 21:41:49,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 21:41:49,942 INFO L225 Difference]: With dead ends: 985 [2022-03-18 21:41:49,942 INFO L226 Difference]: Without dead ends: 763 [2022-03-18 21:41:49,943 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2022-03-18 21:41:49,943 INFO L912 BasicCegarLoop]: 51 mSDtfsCounter, 173 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-18 21:41:49,944 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 73 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-18 21:41:49,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2022-03-18 21:41:50,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 563. [2022-03-18 21:41:50,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 550 states have (on average 1.3127272727272727) internal successors, (722), 553 states have internal predecessors, (722), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-18 21:41:50,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 736 transitions. [2022-03-18 21:41:50,051 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 736 transitions. Word has length 46 [2022-03-18 21:41:50,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 21:41:50,051 INFO L478 AbstractCegarLoop]: Abstraction has 563 states and 736 transitions. [2022-03-18 21:41:50,051 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:41:50,051 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 736 transitions. [2022-03-18 21:41:50,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-18 21:41:50,052 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 21:41:50,052 INFO L500 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 21:41:50,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-03-18 21:41:50,269 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:41:50,270 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 21:41:50,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 21:41:50,270 INFO L85 PathProgramCache]: Analyzing trace with hash -493020880, now seen corresponding path program 5 times [2022-03-18 21:41:50,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 21:41:50,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879004440] [2022-03-18 21:41:50,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:41:50,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 21:41:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:41:50,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 21:41:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:41:50,318 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-18 21:41:50,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 21:41:50,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879004440] [2022-03-18 21:41:50,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879004440] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 21:41:50,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745118691] [2022-03-18 21:41:50,318 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-18 21:41:50,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:41:50,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 21:41:50,319 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-03-18 21:41:50,320 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-03-18 21:41:50,405 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-18 21:41:50,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 21:41:50,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-18 21:41:50,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 21:41:50,494 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-18 21:41:50,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 21:41:50,564 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-18 21:41:50,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745118691] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 21:41:50,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 21:41:50,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-03-18 21:41:50,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241195921] [2022-03-18 21:41:50,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 21:41:50,564 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-18 21:41:50,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 21:41:50,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-18 21:41:50,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-03-18 21:41:50,565 INFO L87 Difference]: Start difference. First operand 563 states and 736 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:41:50,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 21:41:50,879 INFO L93 Difference]: Finished difference Result 741 states and 941 transitions. [2022-03-18 21:41:50,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-18 21:41:50,880 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-03-18 21:41:50,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 21:41:50,881 INFO L225 Difference]: With dead ends: 741 [2022-03-18 21:41:50,881 INFO L226 Difference]: Without dead ends: 581 [2022-03-18 21:41:50,895 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2022-03-18 21:41:50,899 INFO L912 BasicCegarLoop]: 59 mSDtfsCounter, 138 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 21:41:50,900 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 81 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 21:41:50,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2022-03-18 21:41:50,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 520. [2022-03-18 21:41:51,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 507 states have (on average 1.2859960552268244) internal successors, (652), 510 states have internal predecessors, (652), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-18 21:41:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 666 transitions. [2022-03-18 21:41:51,001 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 666 transitions. Word has length 46 [2022-03-18 21:41:51,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 21:41:51,001 INFO L478 AbstractCegarLoop]: Abstraction has 520 states and 666 transitions. [2022-03-18 21:41:51,002 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 21:41:51,002 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 666 transitions. [2022-03-18 21:41:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-03-18 21:41:51,003 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 21:41:51,003 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 21:41:51,022 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-03-18 21:41:51,211 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-03-18 21:41:51,211 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 21:41:51,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 21:41:51,220 INFO L85 PathProgramCache]: Analyzing trace with hash -2141686992, now seen corresponding path program 1 times [2022-03-18 21:41:51,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 21:41:51,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963271420] [2022-03-18 21:41:51,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:41:51,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 21:41:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:41:52,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 21:41:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:41:52,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-03-18 21:41:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:41:52,593 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-18 21:41:52,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 21:41:52,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963271420] [2022-03-18 21:41:52,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963271420] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 21:41:52,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970335798] [2022-03-18 21:41:52,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:41:52,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 21:41:52,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 21:41:52,595 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-03-18 21:41:52,595 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-03-18 21:41:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 21:41:52,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 52 conjunts are in the unsatisfiable core [2022-03-18 21:41:52,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 21:41:52,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-03-18 21:41:52,767 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-18 21:41:52,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2022-03-18 21:41:52,816 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-18 21:41:52,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2022-03-18 21:41:52,981 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-18 21:41:52,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-03-18 21:41:53,243 INFO L356 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2022-03-18 21:41:53,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 84 treesize of output 66 [2022-03-18 21:41:53,498 INFO L356 Elim1Store]: treesize reduction 25, result has 49.0 percent of original size [2022-03-18 21:41:53,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 60 [2022-03-18 21:41:53,557 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-18 21:41:53,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 21:42:00,844 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-18 21:42:00,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970335798] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 21:42:00,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 21:42:00,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 12] total 36 [2022-03-18 21:42:00,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267391410] [2022-03-18 21:42:00,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 21:42:00,845 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-18 21:42:00,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 21:42:00,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-18 21:42:00,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1032, Unknown=8, NotChecked=0, Total=1260 [2022-03-18 21:42:00,845 INFO L87 Difference]: Start difference. First operand 520 states and 666 transitions. Second operand has 36 states, 36 states have (on average 2.611111111111111) internal successors, (94), 35 states have internal predecessors, (94), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-03-18 21:42:10,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 21:42:10,548 INFO L93 Difference]: Finished difference Result 1133 states and 1460 transitions. [2022-03-18 21:42:10,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-18 21:42:10,548 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.611111111111111) internal successors, (94), 35 states have internal predecessors, (94), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2022-03-18 21:42:10,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 21:42:10,551 INFO L225 Difference]: With dead ends: 1133 [2022-03-18 21:42:10,551 INFO L226 Difference]: Without dead ends: 993 [2022-03-18 21:42:10,551 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1242 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=902, Invalid=3781, Unknown=9, NotChecked=0, Total=4692 [2022-03-18 21:42:10,552 INFO L912 BasicCegarLoop]: 37 mSDtfsCounter, 219 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 376 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-18 21:42:10,552 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 97 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 523 Invalid, 0 Unknown, 376 Unchecked, 0.4s Time] [2022-03-18 21:42:10,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2022-03-18 21:42:10,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 714. [2022-03-18 21:42:10,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 701 states have (on average 1.3181169757489302) internal successors, (924), 704 states have internal predecessors, (924), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-18 21:42:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 938 transitions. [2022-03-18 21:42:10,689 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 938 transitions. Word has length 48 [2022-03-18 21:42:10,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 21:42:10,689 INFO L478 AbstractCegarLoop]: Abstraction has 714 states and 938 transitions. [2022-03-18 21:42:10,690 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.611111111111111) internal successors, (94), 35 states have internal predecessors, (94), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-03-18 21:42:10,690 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 938 transitions. [2022-03-18 21:42:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-03-18 21:42:10,691 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 21:42:10,691 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 21:42:10,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-03-18 21:42:10,908 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-03-18 21:42:10,908 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 21:42:10,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 21:42:10,908 INFO L85 PathProgramCache]: Analyzing trace with hash 2086273551, now seen corresponding path program 1 times [2022-03-18 21:42:10,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 21:42:10,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028856800] [2022-03-18 21:42:10,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 21:42:10,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 21:42:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-18 21:42:10,931 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-18 21:42:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-18 21:42:10,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-18 21:42:10,963 INFO L614 BasicCegarLoop]: Counterexample is feasible [2022-03-18 21:42:10,964 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-18 21:42:10,965 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-18 21:42:10,967 INFO L718 BasicCegarLoop]: Path program histogram: [5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 21:42:10,969 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-18 21:42:11,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.03 09:42:11 BasicIcfg [2022-03-18 21:42:11,001 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-18 21:42:11,001 INFO L158 Benchmark]: Toolchain (without parser) took 286963.89ms. Allocated memory was 194.0MB in the beginning and 383.8MB in the end (delta: 189.8MB). Free memory was 143.7MB in the beginning and 152.4MB in the end (delta: -8.7MB). Peak memory consumption was 182.7MB. Max. memory is 8.0GB. [2022-03-18 21:42:11,001 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory was 160.0MB in the beginning and 159.9MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-18 21:42:11,002 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.72ms. Allocated memory is still 194.0MB. Free memory was 143.4MB in the beginning and 169.5MB in the end (delta: -26.0MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2022-03-18 21:42:11,002 INFO L158 Benchmark]: Boogie Preprocessor took 38.50ms. Allocated memory is still 194.0MB. Free memory was 169.5MB in the beginning and 167.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-18 21:42:11,002 INFO L158 Benchmark]: RCFGBuilder took 395.07ms. Allocated memory is still 194.0MB. Free memory was 167.4MB in the beginning and 151.6MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-03-18 21:42:11,002 INFO L158 Benchmark]: IcfgTransformer took 35.77ms. Allocated memory is still 194.0MB. Free memory was 151.6MB in the beginning and 149.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-18 21:42:11,002 INFO L158 Benchmark]: TraceAbstraction took 286272.69ms. Allocated memory was 194.0MB in the beginning and 383.8MB in the end (delta: 189.8MB). Free memory was 149.0MB in the beginning and 152.4MB in the end (delta: -3.4MB). Peak memory consumption was 187.4MB. Max. memory is 8.0GB. [2022-03-18 21:42:11,003 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.09ms. Allocated memory is still 194.0MB. Free memory was 160.0MB in the beginning and 159.9MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 202.72ms. Allocated memory is still 194.0MB. Free memory was 143.4MB in the beginning and 169.5MB in the end (delta: -26.0MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.50ms. Allocated memory is still 194.0MB. Free memory was 169.5MB in the beginning and 167.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 395.07ms. Allocated memory is still 194.0MB. Free memory was 167.4MB in the beginning and 151.6MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * IcfgTransformer took 35.77ms. Allocated memory is still 194.0MB. Free memory was 151.6MB in the beginning and 149.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 286272.69ms. Allocated memory was 194.0MB in the beginning and 383.8MB in the end (delta: 189.8MB). Free memory was 149.0MB in the beginning and 152.4MB in the end (delta: -3.4MB). Peak memory consumption was 187.4MB. Max. memory is 8.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 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int INFINITY = 899; VAL [\old(INFINITY)=901, INFINITY=899] [L18] int nodecount = __VERIFIER_nondet_int(); [L19] int edgecount = __VERIFIER_nondet_int(); [L20] COND FALSE !(!(0 <= nodecount && nodecount <= 4)) VAL [edgecount=1, INFINITY=899, nodecount=2] [L21] COND FALSE !(!(0 <= edgecount && edgecount <= 19)) [L22] int source = 0; [L23] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L24] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L25] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L26] int distance[5]; [L27] int x,y; [L28] int i,j; [L30] i = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, Source={22:0}, source=0, Weight={25:0}] [L30] COND TRUE i < nodecount VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, source=0, Source={22:0}, Weight={25:0}] [L31] COND TRUE i == source [L32] distance[i] = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, source=0, Source={22:0}, Weight={25:0}] [L30] i++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, source=0, Source={22:0}, Weight={25:0}] [L30] COND TRUE i < nodecount VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, Source={22:0}, source=0, Weight={25:0}] [L31] COND FALSE !(i == source) [L35] distance[i] = INFINITY VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, source=0, Source={22:0}, Weight={25:0}] [L30] i++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=2, INFINITY=899, nodecount=2, source=0, Source={22:0}, Weight={25:0}] [L30] COND FALSE !(i < nodecount) VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=2, INFINITY=899, nodecount=2, Source={22:0}, source=0, Weight={25:0}] [L39] i = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, source=0, Source={22:0}, Weight={25:0}] [L39] COND TRUE i < nodecount [L41] j = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, source=0, Source={22:0}, Weight={25:0}] [L41] COND TRUE j < edgecount [L43] EXPR Dest[j] [L43] x = Dest[j] [L44] EXPR Source[j] [L44] y = Source[j] [L45] EXPR distance[x] [L45] EXPR distance[y] [L45] EXPR Weight[j] VAL [Dest={23:0}, distance={21:0}, distance[x]=899, distance[y]=0, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, Source={22:0}, source=0, Weight={25:0}, Weight[j]=0, x=1, y=0] [L45] COND TRUE distance[x] > distance[y] + Weight[j] [L47] distance[x] = -1 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L41] j++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L41] COND FALSE !(j < edgecount) VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L39] i++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L39] COND TRUE i < nodecount [L41] j = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=0, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L41] COND TRUE j < edgecount [L43] EXPR Dest[j] [L43] x = Dest[j] [L44] EXPR Source[j] [L44] y = Source[j] [L45] EXPR distance[x] [L45] EXPR distance[y] [L45] EXPR Weight[j] VAL [Dest={23:0}, distance={21:0}, distance[x]=-1, distance[y]=0, edgecount=1, i=1, INFINITY=899, j=0, nodecount=2, source=0, Source={22:0}, Weight={25:0}, Weight[j]=0, x=1, y=0] [L45] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L41] j++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L41] COND FALSE !(j < edgecount) VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L39] i++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=2, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L39] COND FALSE !(i < nodecount) VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=2, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L51] i = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L51] COND TRUE i < edgecount [L53] EXPR Dest[i] [L53] x = Dest[i] [L54] EXPR Source[i] [L54] y = Source[i] [L55] EXPR distance[x] [L55] EXPR distance[y] [L55] EXPR Weight[i] VAL [Dest={23:0}, distance={21:0}, distance[x]=-1, distance[y]=0, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, Weight[i]=0, x=1, y=0] [L55] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L51] i++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L51] COND FALSE !(i < edgecount) VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L61] i = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L61] COND TRUE i < nodecount [L63] EXPR distance[i] VAL [Dest={23:0}, distance={21:0}, distance[i]=0, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L63] CALL __VERIFIER_assert(distance[i]>=0) VAL [\old(cond)=1, INFINITY=899] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, INFINITY=899] [L63] RET __VERIFIER_assert(distance[i]>=0) VAL [Dest={23:0}, distance={21:0}, distance[i]=0, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L61] i++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L61] COND TRUE i < nodecount [L63] EXPR distance[i] VAL [Dest={23:0}, distance={21:0}, distance[i]=-1, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L63] CALL __VERIFIER_assert(distance[i]>=0) VAL [\old(cond)=0, INFINITY=899] [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, INFINITY=899] [L12] reach_error() VAL [\old(cond)=0, cond=0, INFINITY=899] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 286.2s, OverallIterations: 26, TraceHistogramMax: 4, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 68.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3874 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3860 mSDsluCounter, 2540 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 6431 IncrementalHoareTripleChecker+Unchecked, 1509 mSDsCounter, 1439 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10200 IncrementalHoareTripleChecker+Invalid, 18070 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1439 mSolverCounterUnsat, 1031 mSDtfsCounter, 10200 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2408 GetRequests, 1386 SyntacticMatches, 70 SemanticMatches, 952 ConstructedPredicates, 43 IntricatePredicates, 0 DeprecatedPredicates, 20693 ImplicationChecksByTransitivity, 244.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=714occurred in iteration=25, InterpolantAutomatonStates: 561, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 25 MinimizatonAttempts, 2487 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 209.2s InterpolantComputationTime, 1752 NumberOfCodeBlocks, 1721 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 2403 ConstructedInterpolants, 236 QuantifiedInterpolants, 31702 SizeOfPredicates, 210 NumberOfNonLiveVariables, 6231 ConjunctsInSsa, 442 ConjunctsInUnsatCore, 66 InterpolantComputations, 5 PerfectInterpolantSequences, 467/1046 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-03-18 21:42:11,225 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-03-18 21:42:11,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...