/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/skipped.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-30 22:41:12,328 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-30 22:41:12,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-30 22:41:12,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-30 22:41:12,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-30 22:41:12,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-30 22:41:12,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-30 22:41:12,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-30 22:41:12,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-30 22:41:12,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-30 22:41:12,398 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-30 22:41:12,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-30 22:41:12,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-30 22:41:12,401 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-30 22:41:12,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-30 22:41:12,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-30 22:41:12,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-30 22:41:12,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-30 22:41:12,408 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-30 22:41:12,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-30 22:41:12,414 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-30 22:41:12,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-30 22:41:12,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-30 22:41:12,417 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-30 22:41:12,422 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-30 22:41:12,422 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-30 22:41:12,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-30 22:41:12,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-30 22:41:12,424 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-30 22:41:12,425 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-30 22:41:12,425 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-30 22:41:12,426 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-30 22:41:12,427 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-30 22:41:12,428 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-30 22:41:12,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-30 22:41:12,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-30 22:41:12,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-30 22:41:12,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-30 22:41:12,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-30 22:41:12,430 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-30 22:41:12,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-30 22:41:12,432 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-01-30 22:41:12,458 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-30 22:41:12,459 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-30 22:41:12,459 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-30 22:41:12,459 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-30 22:41:12,460 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-30 22:41:12,460 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-30 22:41:12,460 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-30 22:41:12,460 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-30 22:41:12,461 INFO L138 SettingsManager]: * Use SBE=true [2022-01-30 22:41:12,461 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-30 22:41:12,461 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-30 22:41:12,461 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-30 22:41:12,461 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-30 22:41:12,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-30 22:41:12,461 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-30 22:41:12,462 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-30 22:41:12,462 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-30 22:41:12,462 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-30 22:41:12,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-30 22:41:12,462 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-30 22:41:12,462 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-30 22:41:12,462 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-30 22:41:12,463 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-30 22:41:12,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-30 22:41:12,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-30 22:41:12,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-30 22:41:12,463 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-30 22:41:12,463 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-30 22:41:12,463 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-30 22:41:12,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-30 22:41:12,464 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-30 22:41:12,464 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-30 22:41:12,464 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-30 22:41:12,464 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-30 22:41:12,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-30 22:41:12,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-30 22:41:12,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-30 22:41:12,843 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-30 22:41:12,844 INFO L275 PluginConnector]: CDTParser initialized [2022-01-30 22:41:12,845 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/skipped.c [2022-01-30 22:41:12,898 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a8b6932a/d9a86f09acaf44548c7e6baa3116aff2/FLAGe17ebb925 [2022-01-30 22:41:13,272 INFO L306 CDTParser]: Found 1 translation units. [2022-01-30 22:41:13,272 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/skipped.c [2022-01-30 22:41:13,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a8b6932a/d9a86f09acaf44548c7e6baa3116aff2/FLAGe17ebb925 [2022-01-30 22:41:13,710 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a8b6932a/d9a86f09acaf44548c7e6baa3116aff2 [2022-01-30 22:41:13,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-30 22:41:13,714 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-30 22:41:13,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-30 22:41:13,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-30 22:41:13,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-30 22:41:13,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 10:41:13" (1/1) ... [2022-01-30 22:41:13,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6713757f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:41:13, skipping insertion in model container [2022-01-30 22:41:13,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 10:41:13" (1/1) ... [2022-01-30 22:41:13,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-30 22:41:13,765 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-30 22:41:13,948 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/skipped.c[398,411] [2022-01-30 22:41:14,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-30 22:41:14,009 INFO L203 MainTranslator]: Completed pre-run [2022-01-30 22:41:14,022 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/skipped.c[398,411] [2022-01-30 22:41:14,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-30 22:41:14,044 INFO L208 MainTranslator]: Completed translation [2022-01-30 22:41:14,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:41:14 WrapperNode [2022-01-30 22:41:14,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-30 22:41:14,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-30 22:41:14,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-30 22:41:14,045 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-30 22:41:14,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:41:14" (1/1) ... [2022-01-30 22:41:14,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:41:14" (1/1) ... [2022-01-30 22:41:14,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:41:14" (1/1) ... [2022-01-30 22:41:14,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:41:14" (1/1) ... [2022-01-30 22:41:14,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:41:14" (1/1) ... [2022-01-30 22:41:14,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:41:14" (1/1) ... [2022-01-30 22:41:14,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:41:14" (1/1) ... [2022-01-30 22:41:14,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-30 22:41:14,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-30 22:41:14,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-30 22:41:14,082 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-30 22:41:14,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:41:14" (1/1) ... [2022-01-30 22:41:14,088 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-30 22:41:14,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:41:14,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-30 22:41:14,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-30 22:41:14,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-30 22:41:14,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-30 22:41:14,145 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-30 22:41:14,145 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-30 22:41:14,145 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-30 22:41:14,145 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-30 22:41:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-30 22:41:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-30 22:41:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-30 22:41:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-30 22:41:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-30 22:41:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-30 22:41:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-30 22:41:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-30 22:41:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-30 22:41:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-30 22:41:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-30 22:41:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-30 22:41:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-30 22:41:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-30 22:41:14,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-30 22:41:14,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-30 22:41:14,216 INFO L234 CfgBuilder]: Building ICFG [2022-01-30 22:41:14,218 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-30 22:41:14,389 INFO L275 CfgBuilder]: Performing block encoding [2022-01-30 22:41:14,393 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-30 22:41:14,393 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-30 22:41:14,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 10:41:14 BoogieIcfgContainer [2022-01-30 22:41:14,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-30 22:41:14,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-30 22:41:14,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-30 22:41:14,400 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-30 22:41:14,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 10:41:13" (1/3) ... [2022-01-30 22:41:14,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@596a711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 10:41:14, skipping insertion in model container [2022-01-30 22:41:14,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:41:14" (2/3) ... [2022-01-30 22:41:14,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@596a711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 10:41:14, skipping insertion in model container [2022-01-30 22:41:14,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 10:41:14" (3/3) ... [2022-01-30 22:41:14,402 INFO L111 eAbstractionObserver]: Analyzing ICFG skipped.c [2022-01-30 22:41:14,406 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-30 22:41:14,406 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-30 22:41:14,473 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-30 22:41:14,481 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-30 22:41:14,481 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-30 22:41:14,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 28 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-30 22:41:14,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-30 22:41:14,533 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:41:14,533 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:41:14,540 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:41:14,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:41:14,545 INFO L85 PathProgramCache]: Analyzing trace with hash 535893130, now seen corresponding path program 1 times [2022-01-30 22:41:14,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:41:14,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130099675] [2022-01-30 22:41:14,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:14,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:41:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:14,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:41:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:14,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-30 22:41:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:14,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-30 22:41:14,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:41:14,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130099675] [2022-01-30 22:41:14,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130099675] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-30 22:41:14,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-30 22:41:14,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-30 22:41:14,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153210013] [2022-01-30 22:41:14,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-30 22:41:14,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-30 22:41:14,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:41:14,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-30 22:41:14,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-30 22:41:14,852 INFO L87 Difference]: Start difference. First operand has 37 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 28 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-30 22:41:14,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:41:14,988 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2022-01-30 22:41:14,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-30 22:41:14,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-01-30 22:41:14,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:41:14,994 INFO L225 Difference]: With dead ends: 67 [2022-01-30 22:41:14,994 INFO L226 Difference]: Without dead ends: 34 [2022-01-30 22:41:14,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-30 22:41:14,999 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 9 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-30 22:41:15,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 56 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-30 22:41:15,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-30 22:41:15,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-01-30 22:41:15,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-30 22:41:15,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-01-30 22:41:15,025 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2022-01-30 22:41:15,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:41:15,025 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-01-30 22:41:15,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-30 22:41:15,026 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-01-30 22:41:15,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-30 22:41:15,027 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:41:15,027 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:41:15,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-30 22:41:15,027 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:41:15,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:41:15,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1366996202, now seen corresponding path program 1 times [2022-01-30 22:41:15,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:41:15,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771860834] [2022-01-30 22:41:15,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:15,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:41:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:15,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:41:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:15,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-30 22:41:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:15,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-30 22:41:15,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:41:15,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771860834] [2022-01-30 22:41:15,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771860834] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:41:15,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061661590] [2022-01-30 22:41:15,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:15,132 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:41:15,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:41:15,134 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:41:15,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-30 22:41:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:15,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-30 22:41:15,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:41:15,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-30 22:41:15,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:41:15,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-30 22:41:15,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061661590] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:41:15,442 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:41:15,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-01-30 22:41:15,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026809051] [2022-01-30 22:41:15,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:41:15,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-30 22:41:15,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:41:15,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-30 22:41:15,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-30 22:41:15,455 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-30 22:41:15,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:41:15,573 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-01-30 22:41:15,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-30 22:41:15,574 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-01-30 22:41:15,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:41:15,576 INFO L225 Difference]: With dead ends: 59 [2022-01-30 22:41:15,576 INFO L226 Difference]: Without dead ends: 36 [2022-01-30 22:41:15,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-30 22:41:15,578 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 11 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-30 22:41:15,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 57 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-30 22:41:15,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-30 22:41:15,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-01-30 22:41:15,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-30 22:41:15,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-01-30 22:41:15,592 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 24 [2022-01-30 22:41:15,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:41:15,593 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-01-30 22:41:15,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-30 22:41:15,593 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-01-30 22:41:15,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-30 22:41:15,595 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:41:15,595 INFO L514 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] [2022-01-30 22:41:15,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-30 22:41:15,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:41:15,812 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:41:15,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:41:15,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1779937352, now seen corresponding path program 2 times [2022-01-30 22:41:15,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:41:15,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570443505] [2022-01-30 22:41:15,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:15,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:41:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:16,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:41:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:16,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-30 22:41:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:16,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-30 22:41:16,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:41:16,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570443505] [2022-01-30 22:41:16,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570443505] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-30 22:41:16,065 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-30 22:41:16,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-30 22:41:16,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434420776] [2022-01-30 22:41:16,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-30 22:41:16,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-30 22:41:16,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:41:16,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-30 22:41:16,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-30 22:41:16,067 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-30 22:41:16,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:41:16,163 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-01-30 22:41:16,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-30 22:41:16,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-01-30 22:41:16,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:41:16,165 INFO L225 Difference]: With dead ends: 51 [2022-01-30 22:41:16,165 INFO L226 Difference]: Without dead ends: 40 [2022-01-30 22:41:16,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-30 22:41:16,166 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 59 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-30 22:41:16,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 34 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-30 22:41:16,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-30 22:41:16,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2022-01-30 22:41:16,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-30 22:41:16,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-01-30 22:41:16,182 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 26 [2022-01-30 22:41:16,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:41:16,182 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-01-30 22:41:16,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-30 22:41:16,183 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-01-30 22:41:16,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-30 22:41:16,184 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:41:16,184 INFO L514 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, 1, 1, 1] [2022-01-30 22:41:16,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-30 22:41:16,184 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:41:16,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:41:16,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1702830002, now seen corresponding path program 1 times [2022-01-30 22:41:16,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:41:16,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737633118] [2022-01-30 22:41:16,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:16,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:41:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:16,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:41:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:16,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-30 22:41:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:16,468 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-30 22:41:16,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:41:16,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737633118] [2022-01-30 22:41:16,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737633118] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:41:16,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271801481] [2022-01-30 22:41:16,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:16,469 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:41:16,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:41:16,472 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:41:16,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-30 22:41:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:16,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-30 22:41:16,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:41:16,627 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-01-30 22:41:16,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:41:16,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-01-30 22:41:16,740 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-30 22:41:16,773 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-30 22:41:16,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:41:16,876 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2022-01-30 22:41:16,884 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2022-01-30 22:41:16,938 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-30 22:41:16,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271801481] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:41:16,939 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:41:16,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 18 [2022-01-30 22:41:16,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138498207] [2022-01-30 22:41:16,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:41:16,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-30 22:41:16,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:41:16,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-30 22:41:16,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-01-30 22:41:16,941 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 18 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 4 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-30 22:41:17,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:41:17,247 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2022-01-30 22:41:17,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-30 22:41:17,248 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 4 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-01-30 22:41:17,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:41:17,250 INFO L225 Difference]: With dead ends: 69 [2022-01-30 22:41:17,250 INFO L226 Difference]: Without dead ends: 67 [2022-01-30 22:41:17,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2022-01-30 22:41:17,251 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 77 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-30 22:41:17,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 148 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-30 22:41:17,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-30 22:41:17,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2022-01-30 22:41:17,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 40 states have internal predecessors, (48), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-30 22:41:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2022-01-30 22:41:17,273 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 31 [2022-01-30 22:41:17,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:41:17,273 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2022-01-30 22:41:17,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 4 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-30 22:41:17,274 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-01-30 22:41:17,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-30 22:41:17,274 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:41:17,274 INFO L514 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, 1, 1, 1] [2022-01-30 22:41:17,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-30 22:41:17,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-30 22:41:17,496 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:41:17,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:41:17,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1001765424, now seen corresponding path program 1 times [2022-01-30 22:41:17,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:41:17,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336342087] [2022-01-30 22:41:17,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:17,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:41:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:17,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:41:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:17,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-30 22:41:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:17,651 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-30 22:41:17,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:41:17,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336342087] [2022-01-30 22:41:17,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336342087] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:41:17,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875214128] [2022-01-30 22:41:17,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:17,652 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:41:17,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:41:17,653 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:41:17,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-30 22:41:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:17,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-30 22:41:17,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:41:17,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:41:17,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-01-30 22:41:17,845 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-30 22:41:17,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-30 22:41:17,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:41:17,988 INFO L353 Elim1Store]: treesize reduction 8, result has 38.5 percent of original size [2022-01-30 22:41:17,989 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 16 [2022-01-30 22:41:18,034 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-30 22:41:18,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875214128] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:41:18,035 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:41:18,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 20 [2022-01-30 22:41:18,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152691987] [2022-01-30 22:41:18,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:41:18,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-30 22:41:18,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:41:18,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-30 22:41:18,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2022-01-30 22:41:18,037 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 20 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 17 states have internal predecessors, (44), 4 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-30 22:41:18,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:41:18,294 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2022-01-30 22:41:18,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-30 22:41:18,295 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 17 states have internal predecessors, (44), 4 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-01-30 22:41:18,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:41:18,297 INFO L225 Difference]: With dead ends: 71 [2022-01-30 22:41:18,297 INFO L226 Difference]: Without dead ends: 69 [2022-01-30 22:41:18,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2022-01-30 22:41:18,298 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 61 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-30 22:41:18,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 157 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-30 22:41:18,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-01-30 22:41:18,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 42. [2022-01-30 22:41:18,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-30 22:41:18,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-01-30 22:41:18,308 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 31 [2022-01-30 22:41:18,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:41:18,308 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-01-30 22:41:18,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 17 states have internal predecessors, (44), 4 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-30 22:41:18,308 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-01-30 22:41:18,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-30 22:41:18,309 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:41:18,309 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:41:18,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-30 22:41:18,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:41:18,527 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:41:18,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:41:18,527 INFO L85 PathProgramCache]: Analyzing trace with hash 534619777, now seen corresponding path program 1 times [2022-01-30 22:41:18,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:41:18,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175940643] [2022-01-30 22:41:18,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:18,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:41:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:18,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:41:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:18,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-30 22:41:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:18,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-30 22:41:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:18,673 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-30 22:41:18,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:41:18,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175940643] [2022-01-30 22:41:18,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175940643] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:41:18,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731431244] [2022-01-30 22:41:18,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:18,674 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:41:18,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:41:18,675 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:41:18,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-30 22:41:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:18,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-30 22:41:18,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:41:18,792 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-01-30 22:41:21,038 INFO L353 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-01-30 22:41:21,038 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2022-01-30 22:41:21,081 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-30 22:41:21,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:41:21,193 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-01-30 22:41:21,205 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2022-01-30 22:41:21,262 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-30 22:41:21,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731431244] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:41:21,263 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:41:21,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 18 [2022-01-30 22:41:21,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806013878] [2022-01-30 22:41:21,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:41:21,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-30 22:41:21,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:41:21,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-30 22:41:21,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=254, Unknown=1, NotChecked=0, Total=306 [2022-01-30 22:41:21,265 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 18 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-30 22:41:21,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:41:21,557 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-01-30 22:41:21,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-30 22:41:21,560 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2022-01-30 22:41:21,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:41:21,561 INFO L225 Difference]: With dead ends: 82 [2022-01-30 22:41:21,561 INFO L226 Difference]: Without dead ends: 80 [2022-01-30 22:41:21,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 74 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=74, Invalid=387, Unknown=1, NotChecked=0, Total=462 [2022-01-30 22:41:21,563 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 43 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-30 22:41:21,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 172 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 432 Invalid, 0 Unknown, 52 Unchecked, 0.2s Time] [2022-01-30 22:41:21,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-01-30 22:41:21,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 59. [2022-01-30 22:41:21,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 48 states have internal predecessors, (57), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-30 22:41:21,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2022-01-30 22:41:21,571 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 39 [2022-01-30 22:41:21,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:41:21,571 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2022-01-30 22:41:21,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-30 22:41:21,571 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-01-30 22:41:21,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-30 22:41:21,572 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:41:21,572 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:41:21,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-30 22:41:21,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:41:21,796 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:41:21,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:41:21,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1053728125, now seen corresponding path program 1 times [2022-01-30 22:41:21,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:41:21,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103989600] [2022-01-30 22:41:21,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:21,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:41:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:22,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:41:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:22,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-30 22:41:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:22,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-30 22:41:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-30 22:41:22,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:41:22,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103989600] [2022-01-30 22:41:22,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103989600] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:41:22,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067084051] [2022-01-30 22:41:22,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:22,190 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:41:22,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:41:22,192 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:41:22,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-30 22:41:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:22,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-30 22:41:22,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:41:24,420 INFO L353 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-01-30 22:41:24,420 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 14 [2022-01-30 22:41:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-30 22:41:24,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:41:25,292 INFO L353 Elim1Store]: treesize reduction 10, result has 33.3 percent of original size [2022-01-30 22:41:25,293 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-01-30 22:41:25,338 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-30 22:41:25,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067084051] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:41:25,338 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:41:25,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 19 [2022-01-30 22:41:25,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191013374] [2022-01-30 22:41:25,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:41:25,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-30 22:41:25,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:41:25,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-30 22:41:25,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=287, Unknown=2, NotChecked=0, Total=342 [2022-01-30 22:41:25,340 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 19 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-30 22:41:25,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:41:25,634 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2022-01-30 22:41:25,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-30 22:41:25,634 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2022-01-30 22:41:25,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:41:25,635 INFO L225 Difference]: With dead ends: 110 [2022-01-30 22:41:25,635 INFO L226 Difference]: Without dead ends: 108 [2022-01-30 22:41:25,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 74 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=80, Invalid=424, Unknown=2, NotChecked=0, Total=506 [2022-01-30 22:41:25,636 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 43 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-30 22:41:25,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 150 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 386 Invalid, 0 Unknown, 64 Unchecked, 0.2s Time] [2022-01-30 22:41:25,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-01-30 22:41:25,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 61. [2022-01-30 22:41:25,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 50 states have internal predecessors, (60), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-30 22:41:25,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2022-01-30 22:41:25,651 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 39 [2022-01-30 22:41:25,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:41:25,651 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2022-01-30 22:41:25,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-30 22:41:25,651 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-01-30 22:41:25,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-30 22:41:25,654 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:41:25,654 INFO L514 BasicCegarLoop]: trace histogram [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-01-30 22:41:25,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-30 22:41:25,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:41:25,878 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:41:25,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:41:25,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1876908679, now seen corresponding path program 1 times [2022-01-30 22:41:25,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:41:25,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927405335] [2022-01-30 22:41:25,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:25,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:41:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:26,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:41:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:26,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-30 22:41:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:26,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-30 22:41:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:26,140 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-30 22:41:26,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:41:26,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927405335] [2022-01-30 22:41:26,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927405335] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:41:26,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403661522] [2022-01-30 22:41:26,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:26,141 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:41:26,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:41:26,142 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:41:26,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-30 22:41:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:26,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-30 22:41:26,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:41:26,659 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-30 22:41:26,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:41:27,008 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-30 22:41:27,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403661522] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:41:27,008 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:41:27,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2022-01-30 22:41:27,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590298318] [2022-01-30 22:41:27,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:41:27,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-30 22:41:27,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:41:27,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-30 22:41:27,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2022-01-30 22:41:27,010 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 20 states have internal predecessors, (69), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-30 22:41:27,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:41:27,514 INFO L93 Difference]: Finished difference Result 154 states and 179 transitions. [2022-01-30 22:41:27,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-30 22:41:27,514 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 20 states have internal predecessors, (69), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2022-01-30 22:41:27,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:41:27,515 INFO L225 Difference]: With dead ends: 154 [2022-01-30 22:41:27,515 INFO L226 Difference]: Without dead ends: 77 [2022-01-30 22:41:27,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2022-01-30 22:41:27,517 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 163 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-30 22:41:27,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 60 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-30 22:41:27,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-01-30 22:41:27,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2022-01-30 22:41:27,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 54 states have internal predecessors, (64), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-30 22:41:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2022-01-30 22:41:27,535 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 44 [2022-01-30 22:41:27,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:41:27,535 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2022-01-30 22:41:27,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 20 states have internal predecessors, (69), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-30 22:41:27,536 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2022-01-30 22:41:27,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-30 22:41:27,540 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:41:27,540 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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-01-30 22:41:27,567 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-01-30 22:41:27,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:41:27,755 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:41:27,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:41:27,756 INFO L85 PathProgramCache]: Analyzing trace with hash 917587637, now seen corresponding path program 2 times [2022-01-30 22:41:27,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:41:27,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507375011] [2022-01-30 22:41:27,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:27,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:41:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:28,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:41:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:28,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-30 22:41:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:28,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-30 22:41:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-30 22:41:28,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:41:28,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507375011] [2022-01-30 22:41:28,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507375011] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:41:28,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115199032] [2022-01-30 22:41:28,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-30 22:41:28,222 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:41:28,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:41:28,224 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:41:28,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-30 22:41:28,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-30 22:41:28,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:41:28,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-30 22:41:28,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:41:28,446 INFO L353 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-01-30 22:41:28,446 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-01-30 22:41:28,470 INFO L353 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-01-30 22:41:28,470 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-01-30 22:41:30,628 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-01-30 22:41:30,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 14 [2022-01-30 22:41:30,683 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-30 22:41:30,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:41:35,275 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_63 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_63)) (forall ((v_ArrVal_155 Int)) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (- 4) (* v_main_~i~0_63 8)) v_ArrVal_155) (+ c_main_~a~0.offset 4)) 1)))) is different from false [2022-01-30 22:41:37,329 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2022-01-30 22:41:37,336 INFO L353 Elim1Store]: treesize reduction 10, result has 33.3 percent of original size [2022-01-30 22:41:37,337 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 42 [2022-01-30 22:41:37,388 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 1 not checked. [2022-01-30 22:41:37,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115199032] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:41:37,388 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:41:37,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 12] total 36 [2022-01-30 22:41:37,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162686777] [2022-01-30 22:41:37,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:41:37,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-30 22:41:37,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:41:37,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-30 22:41:37,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1047, Unknown=4, NotChecked=66, Total=1260 [2022-01-30 22:41:37,392 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 36 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 states have internal predecessors, (83), 7 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-30 22:41:40,349 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (+ (- 1) c_main_~i~0)) (<= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8) (- 4))) 1) (* c_main_~i~0 2)) (<= 1 (div (+ (* (- 1) c_main_~i~0) 3 (* (- 1) c_main_~a~0.offset) c_~SIZE~0) 4)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_63 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_63)) (forall ((v_ArrVal_155 Int)) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (- 4) (* v_main_~i~0_63 8)) v_ArrVal_155) (+ c_main_~a~0.offset 4)) 1))))) is different from false [2022-01-30 22:41:42,570 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* (- 1) c_main_~i~0)) (.cse1 (* (- 1) c_main_~a~0.offset)) (.cse2 (forall ((v_main_~i~0_63 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_63)) (forall ((v_ArrVal_155 Int)) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (- 4) (* v_main_~i~0_63 8)) v_ArrVal_155) (+ c_main_~a~0.offset 4)) 1)))))) (and (<= 1 (div (+ .cse0 3 .cse1 c_~SIZE~0) 4)) (or (< (* c_main_~i~0 2) (+ |c_main_#t~mem10| 1)) .cse2) (or (<= (+ (div (+ .cse0 2 .cse1 c_~SIZE~0) 4) 1) c_main_~i~0) (<= (+ c_main_~i~0 c_main_~a~0.offset 3) c_~SIZE~0) (<= c_~SIZE~0 (+ c_main_~i~0 c_main_~a~0.offset 1))) (= c_main_~a~0.offset 0) .cse2)) is different from false [2022-01-30 22:41:42,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:41:42,992 INFO L93 Difference]: Finished difference Result 153 states and 186 transitions. [2022-01-30 22:41:42,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-30 22:41:42,992 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 states have internal predecessors, (83), 7 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 48 [2022-01-30 22:41:42,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:41:42,993 INFO L225 Difference]: With dead ends: 153 [2022-01-30 22:41:42,993 INFO L226 Difference]: Without dead ends: 151 [2022-01-30 22:41:42,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 91 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=379, Invalid=3048, Unknown=7, NotChecked=348, Total=3782 [2022-01-30 22:41:42,995 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 126 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 241 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-30 22:41:42,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 250 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 710 Invalid, 0 Unknown, 241 Unchecked, 0.4s Time] [2022-01-30 22:41:42,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-01-30 22:41:43,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 77. [2022-01-30 22:41:43,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 66 states have internal predecessors, (83), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-30 22:41:43,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2022-01-30 22:41:43,006 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 48 [2022-01-30 22:41:43,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:41:43,007 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2022-01-30 22:41:43,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 states have internal predecessors, (83), 7 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-30 22:41:43,007 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2022-01-30 22:41:43,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-30 22:41:43,007 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:41:43,008 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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-01-30 22:41:43,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-30 22:41:43,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:41:43,232 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:41:43,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:41:43,232 INFO L85 PathProgramCache]: Analyzing trace with hash 783574131, now seen corresponding path program 1 times [2022-01-30 22:41:43,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:41:43,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721221822] [2022-01-30 22:41:43,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:43,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:41:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:43,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:41:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:43,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-30 22:41:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:43,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-30 22:41:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-30 22:41:43,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:41:43,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721221822] [2022-01-30 22:41:43,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721221822] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:41:43,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275625239] [2022-01-30 22:41:43,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:43,577 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:41:43,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:41:43,578 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:41:43,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-30 22:41:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:43,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-30 22:41:43,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:41:43,776 INFO L353 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-01-30 22:41:43,777 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-01-30 22:41:43,796 INFO L353 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-01-30 22:41:43,796 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-01-30 22:41:45,944 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-01-30 22:41:45,944 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 14 [2022-01-30 22:41:45,995 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-30 22:41:45,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:41:52,136 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_71 Int)) (or (forall ((v_ArrVal_188 Int)) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (- 4) (* v_main_~i~0_71 8)) v_ArrVal_188) (+ c_main_~a~0.offset 4)) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_71)))) is different from false [2022-01-30 22:41:54,199 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2022-01-30 22:41:54,205 INFO L353 Elim1Store]: treesize reduction 10, result has 33.3 percent of original size [2022-01-30 22:41:54,205 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 42 [2022-01-30 22:41:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 1 not checked. [2022-01-30 22:41:54,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275625239] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:41:54,257 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:41:54,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 12] total 36 [2022-01-30 22:41:54,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589466761] [2022-01-30 22:41:54,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:41:54,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-30 22:41:54,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:41:54,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-30 22:41:54,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1047, Unknown=4, NotChecked=66, Total=1260 [2022-01-30 22:41:54,259 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand has 36 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 states have internal predecessors, (83), 7 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-30 22:41:56,640 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (+ (- 1) c_main_~i~0)) (<= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8) (- 4))) 1) (* c_main_~i~0 2)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_71 Int)) (or (forall ((v_ArrVal_188 Int)) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (- 4) (* v_main_~i~0_71 8)) v_ArrVal_188) (+ c_main_~a~0.offset 4)) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_71)))) (<= (+ c_main_~i~0 1) c_~SIZE~0)) is different from false [2022-01-30 22:41:58,852 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (<= 2 c_main_~i~0) (or (<= (+ (div (+ (* (- 1) c_main_~i~0) 2 (* (- 1) c_main_~a~0.offset) c_~SIZE~0) 4) 1) c_main_~i~0) (<= (+ c_main_~i~0 c_main_~a~0.offset 3) c_~SIZE~0) (<= c_~SIZE~0 (+ c_main_~i~0 c_main_~a~0.offset 1))) (<= (select .cse0 4) 1) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_71 Int)) (or (forall ((v_ArrVal_188 Int)) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (- 4) (* v_main_~i~0_71 8)) v_ArrVal_188) (+ c_main_~a~0.offset 4)) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_71)))) (not (= (+ c_main_~a~0.offset (* c_main_~i~0 8) (- 4)) 4)) (<= (+ c_main_~i~0 1) c_~SIZE~0) (<= (select .cse0 (+ c_main_~a~0.offset 4)) 1))) is different from false [2022-01-30 22:41:59,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:41:59,293 INFO L93 Difference]: Finished difference Result 147 states and 185 transitions. [2022-01-30 22:41:59,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-01-30 22:41:59,293 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 states have internal predecessors, (83), 7 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 48 [2022-01-30 22:41:59,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:41:59,295 INFO L225 Difference]: With dead ends: 147 [2022-01-30 22:41:59,295 INFO L226 Difference]: Without dead ends: 145 [2022-01-30 22:41:59,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=487, Invalid=3301, Unknown=6, NotChecked=366, Total=4160 [2022-01-30 22:41:59,297 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 187 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-30 22:41:59,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 202 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 742 Invalid, 0 Unknown, 218 Unchecked, 0.4s Time] [2022-01-30 22:41:59,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-01-30 22:41:59,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 54. [2022-01-30 22:41:59,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.119047619047619) internal successors, (47), 43 states have internal predecessors, (47), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-30 22:41:59,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-01-30 22:41:59,307 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 48 [2022-01-30 22:41:59,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:41:59,307 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-01-30 22:41:59,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 states have internal predecessors, (83), 7 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-30 22:41:59,307 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-01-30 22:41:59,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-30 22:41:59,308 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:41:59,308 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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-01-30 22:41:59,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-30 22:41:59,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-30 22:41:59,519 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:41:59,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:41:59,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1500614392, now seen corresponding path program 2 times [2022-01-30 22:41:59,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:41:59,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668558745] [2022-01-30 22:41:59,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:59,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:41:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:59,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:41:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:59,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-30 22:41:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:59,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-30 22:41:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:59,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-30 22:41:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-30 22:41:59,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:41:59,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668558745] [2022-01-30 22:41:59,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668558745] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:41:59,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455266468] [2022-01-30 22:41:59,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-30 22:41:59,736 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:41:59,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:41:59,740 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:41:59,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-30 22:41:59,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-30 22:41:59,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:41:59,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-30 22:41:59,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:42:00,147 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-30 22:42:00,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:42:00,331 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-30 22:42:00,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455266468] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:42:00,331 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:42:00,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 26 [2022-01-30 22:42:00,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678806563] [2022-01-30 22:42:00,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:42:00,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-30 22:42:00,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:42:00,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-30 22:42:00,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2022-01-30 22:42:00,333 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 25 states have internal predecessors, (81), 9 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-01-30 22:42:00,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:42:00,852 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2022-01-30 22:42:00,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-30 22:42:00,852 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 25 states have internal predecessors, (81), 9 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 51 [2022-01-30 22:42:00,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:42:00,852 INFO L225 Difference]: With dead ends: 94 [2022-01-30 22:42:00,853 INFO L226 Difference]: Without dead ends: 69 [2022-01-30 22:42:00,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=269, Invalid=1213, Unknown=0, NotChecked=0, Total=1482 [2022-01-30 22:42:00,854 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 238 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-30 22:42:00,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 82 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-30 22:42:00,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-01-30 22:42:00,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2022-01-30 22:42:00,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.148936170212766) internal successors, (54), 48 states have internal predecessors, (54), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-30 22:42:00,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2022-01-30 22:42:00,864 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 51 [2022-01-30 22:42:00,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:42:00,864 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2022-01-30 22:42:00,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 25 states have internal predecessors, (81), 9 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-01-30 22:42:00,864 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-01-30 22:42:00,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-30 22:42:00,865 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:42:00,865 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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, 1] [2022-01-30 22:42:00,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-30 22:42:01,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:42:01,068 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:42:01,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:42:01,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1987534506, now seen corresponding path program 3 times [2022-01-30 22:42:01,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:42:01,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594894558] [2022-01-30 22:42:01,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:42:01,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:42:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:01,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:42:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:01,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-30 22:42:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:01,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-30 22:42:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:01,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-01-30 22:42:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:01,585 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-30 22:42:01,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:42:01,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594894558] [2022-01-30 22:42:01,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594894558] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:42:01,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394547438] [2022-01-30 22:42:01,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-30 22:42:01,586 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:42:01,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:42:01,588 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:42:01,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-30 22:42:01,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-30 22:42:01,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:42:01,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-30 22:42:01,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:42:01,725 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-01-30 22:42:01,769 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-01-30 22:42:01,773 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-01-30 22:42:02,084 INFO L353 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2022-01-30 22:42:02,085 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 13 [2022-01-30 22:42:02,153 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-30 22:42:02,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:42:02,921 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-01-30 22:42:02,923 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2022-01-30 22:42:02,992 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-30 22:42:02,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394547438] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:42:02,993 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:42:02,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13, 11] total 38 [2022-01-30 22:42:02,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991293324] [2022-01-30 22:42:02,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:42:02,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-30 22:42:02,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:42:02,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-30 22:42:02,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1280, Unknown=0, NotChecked=0, Total=1406 [2022-01-30 22:42:02,995 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 38 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 34 states have internal predecessors, (87), 11 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-01-30 22:42:09,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:42:09,243 INFO L93 Difference]: Finished difference Result 419 states and 514 transitions. [2022-01-30 22:42:09,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-01-30 22:42:09,244 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 34 states have internal predecessors, (87), 11 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 56 [2022-01-30 22:42:09,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:42:09,246 INFO L225 Difference]: With dead ends: 419 [2022-01-30 22:42:09,246 INFO L226 Difference]: Without dead ends: 417 [2022-01-30 22:42:09,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 113 SyntacticMatches, 9 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4986 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1565, Invalid=13686, Unknown=1, NotChecked=0, Total=15252 [2022-01-30 22:42:09,250 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 681 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 2301 mSolverCounterSat, 487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 3059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 2301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 271 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-30 22:42:09,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [688 Valid, 307 Invalid, 3059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [487 Valid, 2301 Invalid, 0 Unknown, 271 Unchecked, 1.2s Time] [2022-01-30 22:42:09,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-01-30 22:42:09,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 173. [2022-01-30 22:42:09,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 142 states have (on average 1.204225352112676) internal successors, (171), 145 states have internal predecessors, (171), 19 states have call successors, (19), 14 states have call predecessors, (19), 11 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-01-30 22:42:09,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 208 transitions. [2022-01-30 22:42:09,292 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 208 transitions. Word has length 56 [2022-01-30 22:42:09,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:42:09,293 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 208 transitions. [2022-01-30 22:42:09,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 34 states have internal predecessors, (87), 11 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-01-30 22:42:09,293 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 208 transitions. [2022-01-30 22:42:09,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-30 22:42:09,294 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:42:09,294 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:42:09,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-30 22:42:09,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-30 22:42:09,512 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:42:09,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:42:09,512 INFO L85 PathProgramCache]: Analyzing trace with hash -384204756, now seen corresponding path program 1 times [2022-01-30 22:42:09,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:42:09,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965635055] [2022-01-30 22:42:09,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:42:09,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:42:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:10,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:42:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:10,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-30 22:42:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:10,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-30 22:42:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:10,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-01-30 22:42:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:10,221 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-30 22:42:10,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:42:10,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965635055] [2022-01-30 22:42:10,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965635055] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:42:10,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511883729] [2022-01-30 22:42:10,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:42:10,221 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:42:10,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:42:10,222 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:42:10,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-30 22:42:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:10,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-30 22:42:10,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:42:10,443 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-01-30 22:42:10,443 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-01-30 22:42:15,349 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-01-30 22:42:15,350 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 14 [2022-01-30 22:42:15,406 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-30 22:42:15,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:42:19,915 INFO L353 Elim1Store]: treesize reduction 10, result has 33.3 percent of original size [2022-01-30 22:42:19,915 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-01-30 22:42:19,960 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-30 22:42:19,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511883729] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:42:19,960 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:42:19,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14, 12] total 39 [2022-01-30 22:42:19,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686767837] [2022-01-30 22:42:19,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:42:19,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-01-30 22:42:19,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:42:19,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-01-30 22:42:19,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1334, Unknown=5, NotChecked=0, Total=1482 [2022-01-30 22:42:19,962 INFO L87 Difference]: Start difference. First operand 173 states and 208 transitions. Second operand has 39 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 35 states have internal predecessors, (91), 10 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-01-30 22:42:23,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:42:23,248 INFO L93 Difference]: Finished difference Result 289 states and 352 transitions. [2022-01-30 22:42:23,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-30 22:42:23,248 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 35 states have internal predecessors, (91), 10 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 56 [2022-01-30 22:42:23,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:42:23,251 INFO L225 Difference]: With dead ends: 289 [2022-01-30 22:42:23,251 INFO L226 Difference]: Without dead ends: 287 [2022-01-30 22:42:23,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 105 SyntacticMatches, 9 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1259 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=522, Invalid=3762, Unknown=6, NotChecked=0, Total=4290 [2022-01-30 22:42:23,253 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 214 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-30 22:42:23,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 243 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1193 Invalid, 0 Unknown, 89 Unchecked, 0.5s Time] [2022-01-30 22:42:23,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-01-30 22:42:23,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 160. [2022-01-30 22:42:23,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 130 states have (on average 1.1846153846153846) internal successors, (154), 132 states have internal predecessors, (154), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2022-01-30 22:42:23,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 185 transitions. [2022-01-30 22:42:23,284 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 185 transitions. Word has length 56 [2022-01-30 22:42:23,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:42:23,284 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 185 transitions. [2022-01-30 22:42:23,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 35 states have internal predecessors, (91), 10 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-01-30 22:42:23,285 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 185 transitions. [2022-01-30 22:42:23,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-30 22:42:23,285 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:42:23,285 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 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] [2022-01-30 22:42:23,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-30 22:42:23,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-30 22:42:23,492 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:42:23,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:42:23,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1732411169, now seen corresponding path program 3 times [2022-01-30 22:42:23,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:42:23,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367263613] [2022-01-30 22:42:23,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:42:23,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:42:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:24,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:42:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:24,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-30 22:42:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:24,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-30 22:42:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:24,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-01-30 22:42:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:24,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-01-30 22:42:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:24,545 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 6 proven. 41 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-30 22:42:24,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:42:24,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367263613] [2022-01-30 22:42:24,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367263613] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:42:24,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748601226] [2022-01-30 22:42:24,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-30 22:42:24,546 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:42:24,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:42:24,557 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:42:24,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-30 22:42:24,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-30 22:42:24,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:42:24,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-30 22:42:24,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:42:27,230 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-01-30 22:42:27,231 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 14 [2022-01-30 22:42:27,351 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 26 proven. 16 refuted. 4 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-30 22:42:27,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:42:27,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748601226] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:42:27,463 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-30 22:42:27,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 44 [2022-01-30 22:42:27,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89046405] [2022-01-30 22:42:27,464 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-30 22:42:27,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-01-30 22:42:27,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:42:27,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-01-30 22:42:27,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1878, Unknown=1, NotChecked=0, Total=2070 [2022-01-30 22:42:27,465 INFO L87 Difference]: Start difference. First operand 160 states and 185 transitions. Second operand has 44 states, 41 states have (on average 2.1463414634146343) internal successors, (88), 40 states have internal predecessors, (88), 11 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-01-30 22:42:29,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:42:29,130 INFO L93 Difference]: Finished difference Result 272 states and 312 transitions. [2022-01-30 22:42:29,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-01-30 22:42:29,130 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 2.1463414634146343) internal successors, (88), 40 states have internal predecessors, (88), 11 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 64 [2022-01-30 22:42:29,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:42:29,131 INFO L225 Difference]: With dead ends: 272 [2022-01-30 22:42:29,131 INFO L226 Difference]: Without dead ends: 174 [2022-01-30 22:42:29,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 62 SyntacticMatches, 13 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1977 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=674, Invalid=5487, Unknown=1, NotChecked=0, Total=6162 [2022-01-30 22:42:29,133 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 171 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 278 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-30 22:42:29,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 272 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 734 Invalid, 0 Unknown, 278 Unchecked, 0.4s Time] [2022-01-30 22:42:29,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-01-30 22:42:29,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2022-01-30 22:42:29,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 141 states have (on average 1.1843971631205674) internal successors, (167), 143 states have internal predecessors, (167), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2022-01-30 22:42:29,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 198 transitions. [2022-01-30 22:42:29,161 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 198 transitions. Word has length 64 [2022-01-30 22:42:29,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:42:29,161 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 198 transitions. [2022-01-30 22:42:29,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 2.1463414634146343) internal successors, (88), 40 states have internal predecessors, (88), 11 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-01-30 22:42:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 198 transitions. [2022-01-30 22:42:29,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-30 22:42:29,162 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:42:29,162 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2022-01-30 22:42:29,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-01-30 22:42:29,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-30 22:42:29,364 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:42:29,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:42:29,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1329890389, now seen corresponding path program 4 times [2022-01-30 22:42:29,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:42:29,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097316918] [2022-01-30 22:42:29,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:42:29,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:42:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:29,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:42:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:29,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-30 22:42:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:29,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-30 22:42:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:29,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-30 22:42:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:29,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-01-30 22:42:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:29,611 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 18 proven. 22 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-30 22:42:29,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:42:29,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097316918] [2022-01-30 22:42:29,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097316918] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:42:29,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692289591] [2022-01-30 22:42:29,611 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-30 22:42:29,611 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:42:29,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:42:29,616 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:42:29,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-30 22:42:29,681 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-30 22:42:29,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:42:29,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-30 22:42:29,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:42:29,923 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-01-30 22:42:29,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:42:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-30 22:42:30,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692289591] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:42:30,294 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:42:30,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 32 [2022-01-30 22:42:30,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132572275] [2022-01-30 22:42:30,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:42:30,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-30 22:42:30,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:42:30,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-30 22:42:30,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2022-01-30 22:42:30,296 INFO L87 Difference]: Start difference. First operand 171 states and 198 transitions. Second operand has 32 states, 31 states have (on average 3.096774193548387) internal successors, (96), 30 states have internal predecessors, (96), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-30 22:42:30,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:42:30,731 INFO L93 Difference]: Finished difference Result 270 states and 312 transitions. [2022-01-30 22:42:30,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-30 22:42:30,731 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.096774193548387) internal successors, (96), 30 states have internal predecessors, (96), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 69 [2022-01-30 22:42:30,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:42:30,732 INFO L225 Difference]: With dead ends: 270 [2022-01-30 22:42:30,732 INFO L226 Difference]: Without dead ends: 117 [2022-01-30 22:42:30,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=357, Invalid=1203, Unknown=0, NotChecked=0, Total=1560 [2022-01-30 22:42:30,733 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 201 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-30 22:42:30,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 61 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-30 22:42:30,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-01-30 22:42:30,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 110. [2022-01-30 22:42:30,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 90 states have (on average 1.1444444444444444) internal successors, (103), 91 states have internal predecessors, (103), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-30 22:42:30,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2022-01-30 22:42:30,750 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 69 [2022-01-30 22:42:30,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:42:30,751 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2022-01-30 22:42:30,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.096774193548387) internal successors, (96), 30 states have internal predecessors, (96), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-30 22:42:30,751 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2022-01-30 22:42:30,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-30 22:42:30,751 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:42:30,751 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 3, 3, 3, 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] [2022-01-30 22:42:30,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-30 22:42:30,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-30 22:42:30,953 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:42:30,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:42:30,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1397621267, now seen corresponding path program 5 times [2022-01-30 22:42:30,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:42:30,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188933041] [2022-01-30 22:42:30,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:42:30,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:42:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:31,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:42:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:31,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-30 22:42:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:31,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-30 22:42:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:31,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-30 22:42:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:31,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-30 22:42:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:31,263 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 6 proven. 71 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-30 22:42:31,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:42:31,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188933041] [2022-01-30 22:42:31,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188933041] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:42:31,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784079928] [2022-01-30 22:42:31,264 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-30 22:42:31,264 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:42:31,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:42:31,268 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:42:31,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-30 22:42:31,453 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-01-30 22:42:31,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:42:31,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-30 22:42:31,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:42:31,634 INFO L353 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-01-30 22:42:31,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-01-30 22:42:31,654 INFO L353 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-01-30 22:42:31,654 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-01-30 22:42:37,969 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-01-30 22:42:37,969 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 14 [2022-01-30 22:42:38,016 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-30 22:42:38,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:42:46,529 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_140 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_140)) (forall ((v_ArrVal_410 Int)) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_140) c_main_~a~0.offset (- 4)) v_ArrVal_410) (+ c_main_~a~0.offset 12)) 3)))) is different from false [2022-01-30 22:42:48,584 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2022-01-30 22:42:48,589 INFO L353 Elim1Store]: treesize reduction 10, result has 33.3 percent of original size [2022-01-30 22:42:48,590 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 42 [2022-01-30 22:42:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 48 trivial. 2 not checked. [2022-01-30 22:42:48,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784079928] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:42:48,668 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:42:48,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 15] total 40 [2022-01-30 22:42:48,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385725489] [2022-01-30 22:42:48,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:42:48,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-01-30 22:42:48,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:42:48,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-01-30 22:42:48,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1318, Unknown=6, NotChecked=74, Total=1560 [2022-01-30 22:42:48,670 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand has 40 states, 38 states have (on average 3.1315789473684212) internal successors, (119), 37 states have internal predecessors, (119), 13 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-01-30 22:42:50,931 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse0 (* c_main_~i~0 8))) (and (< 15 (+ c_main_~a~0.offset .cse0)) (= c_main_~a~0.offset 0) (<= (select .cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset)) c_main_~i~0) (forall ((v_main_~i~0_140 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_140)) (forall ((v_ArrVal_410 Int)) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_140) c_main_~a~0.offset (- 4)) v_ArrVal_410) (+ c_main_~a~0.offset 12)) 3)))) (<= (select .cse1 (+ c_main_~a~0.offset .cse0 (- 4))) 3) (<= c_main_~i~0 2))) is different from false [2022-01-30 22:42:52,937 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~i~0 8))) (and (< 15 (+ c_main_~a~0.offset .cse0)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_140 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_140)) (forall ((v_ArrVal_410 Int)) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_140) c_main_~a~0.offset (- 4)) v_ArrVal_410) (+ c_main_~a~0.offset 12)) 3)))) (<= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse0 (- 4))) 3) (<= c_main_~i~0 2))) is different from false [2022-01-30 22:42:55,094 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~i~0 8)) (.cse1 (select |c_#memory_int| c_main_~a~0.base))) (and (not (= (+ c_main_~a~0.offset .cse0 (- 4)) 12)) (<= c_main_~i~0 3) (<= (+ (select .cse1 (+ c_main_~a~0.offset .cse0 (- 12))) 3) (* c_main_~i~0 2)) (= c_main_~a~0.offset 0) (<= (select .cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset)) c_main_~i~0) (forall ((v_main_~i~0_140 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_140)) (forall ((v_ArrVal_410 Int)) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_140) c_main_~a~0.offset (- 4)) v_ArrVal_410) (+ c_main_~a~0.offset 12)) 3)))) (<= (select .cse1 12) 3) (<= 3 c_main_~i~0) (= 2 (+ (- 1) c_main_~i~0)))) is different from false [2022-01-30 22:42:57,100 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (not (= (+ c_main_~a~0.offset (* c_main_~i~0 8) (- 4)) 12)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_140 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_140)) (forall ((v_ArrVal_410 Int)) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_140) c_main_~a~0.offset (- 4)) v_ArrVal_410) (+ c_main_~a~0.offset 12)) 3)))) (<= (select .cse0 12) 3) (<= 3 c_main_~i~0) (<= (select .cse0 (+ c_main_~a~0.offset 12)) 3))) is different from false [2022-01-30 22:42:59,276 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (not (= (+ c_main_~a~0.offset (* c_main_~i~0 8) (- 4)) 12)) (<= c_main_~i~0 4) (<= 4 c_main_~i~0) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_140 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_140)) (forall ((v_ArrVal_410 Int)) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_140) c_main_~a~0.offset (- 4)) v_ArrVal_410) (+ c_main_~a~0.offset 12)) 3)))) (<= (select .cse0 12) 3) (<= 3 c_main_~i~0) (<= (select .cse0 (+ c_main_~a~0.offset 12)) 3))) is different from false [2022-01-30 22:42:59,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:42:59,533 INFO L93 Difference]: Finished difference Result 239 states and 284 transitions. [2022-01-30 22:42:59,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-30 22:42:59,533 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 3.1315789473684212) internal successors, (119), 37 states have internal predecessors, (119), 13 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 73 [2022-01-30 22:42:59,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:42:59,535 INFO L225 Difference]: With dead ends: 239 [2022-01-30 22:42:59,535 INFO L226 Difference]: Without dead ends: 237 [2022-01-30 22:42:59,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 128 SyntacticMatches, 22 SemanticMatches, 57 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=312, Invalid=2457, Unknown=11, NotChecked=642, Total=3422 [2022-01-30 22:42:59,536 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 167 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 275 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-30 22:42:59,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 318 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1102 Invalid, 0 Unknown, 275 Unchecked, 0.5s Time] [2022-01-30 22:42:59,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-01-30 22:42:59,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 185. [2022-01-30 22:42:59,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 157 states have (on average 1.2292993630573248) internal successors, (193), 159 states have internal predecessors, (193), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-01-30 22:42:59,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 222 transitions. [2022-01-30 22:42:59,572 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 222 transitions. Word has length 73 [2022-01-30 22:42:59,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:42:59,572 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 222 transitions. [2022-01-30 22:42:59,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 3.1315789473684212) internal successors, (119), 37 states have internal predecessors, (119), 13 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-01-30 22:42:59,573 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 222 transitions. [2022-01-30 22:42:59,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-30 22:42:59,573 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:42:59,573 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 3, 3, 3, 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] [2022-01-30 22:42:59,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-01-30 22:42:59,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:42:59,779 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:42:59,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:42:59,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1740069267, now seen corresponding path program 2 times [2022-01-30 22:42:59,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:42:59,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461788202] [2022-01-30 22:42:59,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:42:59,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:42:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:43:00,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:43:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:43:00,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-30 22:43:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:43:00,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-30 22:43:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:43:00,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-30 22:43:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:43:00,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-30 22:43:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:43:00,693 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 8 proven. 70 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-30 22:43:00,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:43:00,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461788202] [2022-01-30 22:43:00,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461788202] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:43:00,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097795951] [2022-01-30 22:43:00,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-30 22:43:00,694 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:43:00,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:43:00,695 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:43:00,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-01-30 22:43:00,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-30 22:43:00,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:43:00,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-30 22:43:00,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:43:00,868 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-01-30 22:43:00,936 INFO L353 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-01-30 22:43:00,936 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-01-30 22:43:00,953 INFO L353 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-01-30 22:43:00,953 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-01-30 22:43:05,719 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-01-30 22:43:05,719 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 14 [2022-01-30 22:43:05,779 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-01-30 22:43:05,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:43:16,023 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_153 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_153)) (forall ((v_ArrVal_464 Int)) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (- 4) (* 8 v_main_~i~0_153)) v_ArrVal_464) (+ c_main_~a~0.offset 12)) 3)))) is different from false [2022-01-30 22:43:16,031 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2022-01-30 22:43:16,034 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 192 [2022-01-30 22:43:16,157 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 48 trivial. 2 not checked. [2022-01-30 22:43:16,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097795951] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:43:16,158 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:43:16,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 14, 14] total 44 [2022-01-30 22:43:16,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292813150] [2022-01-30 22:43:16,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:43:16,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-01-30 22:43:16,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:43:16,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-01-30 22:43:16,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1632, Unknown=6, NotChecked=82, Total=1892 [2022-01-30 22:43:16,159 INFO L87 Difference]: Start difference. First operand 185 states and 222 transitions. Second operand has 44 states, 42 states have (on average 2.642857142857143) internal successors, (111), 41 states have internal predecessors, (111), 13 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-01-30 22:43:18,742 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (<= 2 c_main_~i~0)) (.cse3 (= c_main_~a~0.offset 0)) (.cse4 (= (+ (* (- 2) (div c_~SIZE~0 2)) c_~SIZE~0) 0)) (.cse5 (<= c_main_~i~0 2)) (.cse1 (select |c_#memory_int| c_main_~a~0.base))) (and (let ((.cse0 (+ c_main_~a~0.offset (* c_main_~i~0 8) (- 4)))) (or (not (= .cse0 12)) (= (+ (select .cse1 .cse0) 1) (* c_main_~i~0 2)))) .cse2 (<= 2 c_~SIZE~0) .cse3 .cse4 (<= (select .cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset)) c_main_~i~0) (or (and .cse2 .cse3 .cse5) (not .cse4)) (<= 6 c_~SIZE~0) .cse5 (forall ((v_main_~i~0_153 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_153)) (forall ((v_ArrVal_464 Int)) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (- 4) (* 8 v_main_~i~0_153)) v_ArrVal_464) (+ c_main_~a~0.offset 12)) 3)))) (<= (select .cse1 12) (+ c_main_~i~0 1)))) is different from false [2022-01-30 22:43:20,755 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (<= 2 c_main_~i~0)) (.cse3 (= c_main_~a~0.offset 0)) (.cse4 (= (+ (* (- 2) (div c_~SIZE~0 2)) c_~SIZE~0) 0)) (.cse5 (<= c_main_~i~0 2)) (.cse1 (select |c_#memory_int| c_main_~a~0.base))) (and (let ((.cse0 (+ c_main_~a~0.offset (* c_main_~i~0 8) (- 4)))) (or (not (= .cse0 12)) (= (+ (select .cse1 .cse0) 1) (* c_main_~i~0 2)))) .cse2 (<= 2 c_~SIZE~0) .cse3 .cse4 (or (and .cse2 .cse3 .cse5) (not .cse4)) (<= 6 c_~SIZE~0) .cse5 (forall ((v_main_~i~0_153 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_153)) (forall ((v_ArrVal_464 Int)) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (- 4) (* 8 v_main_~i~0_153)) v_ArrVal_464) (+ c_main_~a~0.offset 12)) 3)))) (<= (select .cse1 12) (+ c_main_~i~0 1)))) is different from false [2022-01-30 22:43:34,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:43:34,461 INFO L93 Difference]: Finished difference Result 437 states and 548 transitions. [2022-01-30 22:43:34,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-01-30 22:43:34,462 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 2.642857142857143) internal successors, (111), 41 states have internal predecessors, (111), 13 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 73 [2022-01-30 22:43:34,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:43:34,466 INFO L225 Difference]: With dead ends: 437 [2022-01-30 22:43:34,466 INFO L226 Difference]: Without dead ends: 435 [2022-01-30 22:43:34,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 133 SyntacticMatches, 19 SemanticMatches, 89 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2682 ImplicationChecksByTransitivity, 32.3s TimeCoverageRelationStatistics Valid=740, Invalid=6912, Unknown=16, NotChecked=522, Total=8190 [2022-01-30 22:43:34,468 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 340 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 3029 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 3655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 3029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 392 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-30 22:43:34,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 484 Invalid, 3655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 3029 Invalid, 0 Unknown, 392 Unchecked, 1.2s Time] [2022-01-30 22:43:34,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-01-30 22:43:34,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 212. [2022-01-30 22:43:34,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 184 states have (on average 1.2771739130434783) internal successors, (235), 186 states have internal predecessors, (235), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-01-30 22:43:34,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 264 transitions. [2022-01-30 22:43:34,515 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 264 transitions. Word has length 73 [2022-01-30 22:43:34,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:43:34,515 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 264 transitions. [2022-01-30 22:43:34,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 2.642857142857143) internal successors, (111), 41 states have internal predecessors, (111), 13 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-01-30 22:43:34,515 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 264 transitions. [2022-01-30 22:43:34,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-30 22:43:34,516 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:43:34,516 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 3, 3, 3, 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] [2022-01-30 22:43:34,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-01-30 22:43:34,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-30 22:43:34,727 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:43:34,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:43:34,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1999952751, now seen corresponding path program 6 times [2022-01-30 22:43:34,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:43:34,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735229648] [2022-01-30 22:43:34,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:43:34,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:43:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:43:35,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:43:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:43:35,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-30 22:43:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:43:35,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-30 22:43:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:43:35,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-30 22:43:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:43:35,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-30 22:43:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:43:35,568 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-30 22:43:35,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:43:35,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735229648] [2022-01-30 22:43:35,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735229648] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:43:35,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079647897] [2022-01-30 22:43:35,569 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-30 22:43:35,569 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:43:35,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:43:35,572 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:43:35,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-01-30 22:43:35,740 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-01-30 22:43:35,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:43:35,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-30 22:43:35,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:43:35,927 INFO L353 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-01-30 22:43:35,928 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-01-30 22:43:35,962 INFO L353 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-01-30 22:43:35,962 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-01-30 22:44:59,652 INFO L353 Elim1Store]: treesize reduction 44, result has 6.4 percent of original size [2022-01-30 22:44:59,652 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 17 [2022-01-30 22:44:59,729 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-30 22:44:59,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:45:15,575 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_170 Int)) (or (forall ((v_ArrVal_512 Int)) (or (not (<= (+ v_ArrVal_512 1) (* 2 v_main_~i~0_170))) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_170) c_main_~a~0.offset (- 4)) v_ArrVal_512) (+ c_main_~a~0.offset 12)) 3))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_170)))) is different from false [2022-01-30 22:45:17,649 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2022-01-30 22:45:17,656 INFO L353 Elim1Store]: treesize reduction 10, result has 33.3 percent of original size [2022-01-30 22:45:17,656 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 42 [2022-01-30 22:45:17,809 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 7 proven. 33 refuted. 0 times theorem prover too weak. 48 trivial. 2 not checked. [2022-01-30 22:45:17,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079647897] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:45:17,810 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:45:17,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 17, 15] total 50 [2022-01-30 22:45:17,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896977911] [2022-01-30 22:45:17,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:45:17,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-01-30 22:45:17,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:45:17,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-01-30 22:45:17,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=2117, Unknown=29, NotChecked=94, Total=2450 [2022-01-30 22:45:17,812 INFO L87 Difference]: Start difference. First operand 212 states and 264 transitions. Second operand has 50 states, 47 states have (on average 2.574468085106383) internal successors, (121), 46 states have internal predecessors, (121), 13 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-01-30 22:45:26,521 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_main_~i~0 8)) (.cse6 (div c_~SIZE~0 2))) (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse2 (= c_main_~a~0.offset 0)) (.cse4 (= (+ (* (- 2) .cse6) c_~SIZE~0) 0)) (.cse3 (<= c_main_~i~0 2)) (.cse1 (+ c_main_~a~0.offset .cse8 (- 4))) (.cse5 (< 15 (+ c_main_~a~0.offset .cse8))) (.cse7 (<= c_~SIZE~0 6))) (and (<= (+ c_~SIZE~0 (select .cse0 .cse1)) (+ 5 (* c_main_~i~0 2))) (or (and .cse2 .cse3) (not .cse4)) .cse5 (<= 2 c_main_~i~0) (forall ((v_main_~i~0_170 Int)) (or (forall ((v_ArrVal_512 Int)) (or (not (<= (+ v_ArrVal_512 1) (* 2 v_main_~i~0_170))) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_170) c_main_~a~0.offset (- 4)) v_ArrVal_512) (+ c_main_~a~0.offset 12)) 3))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_170)))) (<= 2 c_~SIZE~0) (<= (+ (select .cse0 12) c_~SIZE~0) (+ c_main_~i~0 (* 2 .cse6) 1)) .cse2 .cse4 .cse7 .cse3 (or (= .cse1 12) (and .cse5 .cse7))))) is different from false [2022-01-30 22:46:01,240 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse12 (* c_main_~i~0 8))) (let ((.cse9 (+ c_main_~a~0.offset .cse12)) (.cse3 (+ c_main_~a~0.offset .cse12 (- 4))) (.cse2 (div c_~SIZE~0 2))) (let ((.cse5 (<= c_main_~i~0 3)) (.cse4 (* c_main_~i~0 2)) (.cse7 (= c_main_~a~0.offset 0)) (.cse6 (= (+ (* (- 2) .cse2) c_~SIZE~0) 0)) (.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (* c_main_~i~0 4)) (.cse10 (= .cse3 12)) (.cse8 (< 15 .cse9)) (.cse11 (<= c_~SIZE~0 6))) (and (<= (+ (select .cse0 (+ .cse1 c_main_~a~0.offset)) c_~SIZE~0) (+ c_main_~i~0 (* 2 .cse2))) (<= (+ c_~SIZE~0 (select .cse0 .cse3)) (+ 5 .cse4)) .cse5 (or (not .cse6) (and .cse5 .cse7)) .cse8 (forall ((v_main_~i~0_170 Int)) (or (forall ((v_ArrVal_512 Int)) (or (not (<= (+ v_ArrVal_512 1) (* 2 v_main_~i~0_170))) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_170) c_main_~a~0.offset (- 4)) v_ArrVal_512) (+ c_main_~a~0.offset 12)) 3))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_170)))) (<= 2 c_~SIZE~0) (or (<= (+ (* 4 c_~SIZE~0) 1) .cse9) (and (<= (+ (select .cse0 12) c_~SIZE~0) (+ 3 .cse4)) (not .cse10))) .cse7 .cse6 .cse11 (<= (select .cse0 (+ .cse1 c_main_~a~0.offset 4)) (+ c_main_~i~0 1)) (<= 3 c_main_~i~0) (or .cse10 (and .cse8 .cse11)))))) is different from false [2022-01-30 22:46:04,123 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (* c_main_~i~0 8))) (let ((.cse8 (+ c_main_~a~0.offset .cse11)) (.cse2 (+ c_main_~a~0.offset .cse11 (- 4))) (.cse1 (div c_~SIZE~0 2))) (let ((.cse4 (<= c_main_~i~0 3)) (.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse3 (* c_main_~i~0 2)) (.cse6 (= c_main_~a~0.offset 0)) (.cse5 (= (+ (* (- 2) .cse1) c_~SIZE~0) 0)) (.cse9 (= .cse2 12)) (.cse7 (< 15 .cse8)) (.cse10 (<= c_~SIZE~0 6))) (and (<= (+ (select .cse0 (+ (* c_main_~i~0 4) c_main_~a~0.offset)) c_~SIZE~0) (+ c_main_~i~0 (* 2 .cse1))) (<= (+ c_~SIZE~0 (select .cse0 .cse2)) (+ 5 .cse3)) .cse4 (or (not .cse5) (and .cse4 .cse6)) .cse7 (forall ((v_main_~i~0_170 Int)) (or (forall ((v_ArrVal_512 Int)) (or (not (<= (+ v_ArrVal_512 1) (* 2 v_main_~i~0_170))) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_170) c_main_~a~0.offset (- 4)) v_ArrVal_512) (+ c_main_~a~0.offset 12)) 3))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_170)))) (<= 2 c_~SIZE~0) (or (<= (+ (* 4 c_~SIZE~0) 1) .cse8) (and (<= (+ (select .cse0 12) c_~SIZE~0) (+ 3 .cse3)) (not .cse9))) .cse6 .cse5 .cse10 (<= 3 c_main_~i~0) (or .cse9 (and .cse7 .cse10)))))) is different from false [2022-01-30 22:46:12,487 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_main_~i~0 8))) (let ((.cse0 (not (= (+ c_main_~a~0.offset .cse1 (- 4)) 12))) (.cse2 (+ (select (select |c_#memory_int| c_main_~a~0.base) 12) c_~SIZE~0)) (.cse3 (div c_~SIZE~0 2))) (and .cse0 (forall ((v_main_~i~0_170 Int)) (or (forall ((v_ArrVal_512 Int)) (or (not (<= (+ v_ArrVal_512 1) (* 2 v_main_~i~0_170))) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_170) c_main_~a~0.offset (- 4)) v_ArrVal_512) (+ c_main_~a~0.offset 12)) 3))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_170)))) (or (<= (+ (* 4 c_~SIZE~0) 1) (+ c_main_~a~0.offset .cse1)) (and (<= .cse2 (+ 3 (* c_main_~i~0 2))) .cse0)) (= c_main_~a~0.offset 0) (= (+ (* (- 2) .cse3) c_~SIZE~0) 0) (<= .cse2 (+ (* 2 .cse3) 3))))) is different from false [2022-01-30 22:46:28,378 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (div c_~SIZE~0 2))) (and (not (= (+ c_main_~a~0.offset (* c_main_~i~0 8) (- 4)) 12)) (forall ((v_main_~i~0_170 Int)) (or (forall ((v_ArrVal_512 Int)) (or (not (<= (+ v_ArrVal_512 1) (* 2 v_main_~i~0_170))) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_170) c_main_~a~0.offset (- 4)) v_ArrVal_512) (+ c_main_~a~0.offset 12)) 3))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_170)))) (= c_main_~a~0.offset 0) (= (+ (* (- 2) .cse0) c_~SIZE~0) 0) (<= (+ (select (select |c_#memory_int| c_main_~a~0.base) 12) c_~SIZE~0) (+ (* 2 .cse0) 3)))) is different from false [2022-01-30 22:46:30,386 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (div c_~SIZE~0 2))) (and (forall ((v_main_~i~0_170 Int)) (or (forall ((v_ArrVal_512 Int)) (or (not (<= (+ v_ArrVal_512 1) (* 2 v_main_~i~0_170))) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_170) c_main_~a~0.offset (- 4)) v_ArrVal_512) (+ c_main_~a~0.offset 12)) 3))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_170)))) (= c_main_~a~0.offset 0) (= (+ (* (- 2) .cse0) c_~SIZE~0) 0) (<= (+ (select (select |c_#memory_int| c_main_~a~0.base) 12) c_~SIZE~0) (+ (* 2 .cse0) 3)))) is different from false [2022-01-30 22:46:51,960 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8) (- 4))) 1) (* c_main_~i~0 2)) (= c_main_~i~0 2) (forall ((v_main_~i~0_170 Int)) (or (forall ((v_ArrVal_512 Int)) (or (not (<= (+ v_ArrVal_512 1) (* 2 v_main_~i~0_170))) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_170) c_main_~a~0.offset (- 4)) v_ArrVal_512) (+ c_main_~a~0.offset 12)) 3))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_170))))) is different from false [2022-01-30 22:46:53,991 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_main_~i~0_170 Int)) (or (forall ((v_ArrVal_512 Int)) (or (not (<= (+ v_ArrVal_512 1) (* 2 v_main_~i~0_170))) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_170) c_main_~a~0.offset (- 4)) v_ArrVal_512) (+ c_main_~a~0.offset 12)) 3))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_170)))))) (and .cse0 (or (< (* c_main_~i~0 2) (+ |c_main_#t~mem10| 1)) .cse0))) is different from false [2022-01-30 22:46:54,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:46:54,135 INFO L93 Difference]: Finished difference Result 614 states and 787 transitions. [2022-01-30 22:46:54,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-01-30 22:46:54,139 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 2.574468085106383) internal successors, (121), 46 states have internal predecessors, (121), 13 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 73 [2022-01-30 22:46:54,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:46:54,142 INFO L225 Difference]: With dead ends: 614 [2022-01-30 22:46:54,142 INFO L226 Difference]: Without dead ends: 612 [2022-01-30 22:46:54,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 132 SyntacticMatches, 12 SemanticMatches, 87 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1916 ImplicationChecksByTransitivity, 197.2s TimeCoverageRelationStatistics Valid=687, Invalid=5589, Unknown=80, NotChecked=1476, Total=7832 [2022-01-30 22:46:54,143 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 152 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 1887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 508 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-30 22:46:54,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 485 Invalid, 1887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1290 Invalid, 0 Unknown, 508 Unchecked, 0.7s Time] [2022-01-30 22:46:54,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2022-01-30 22:46:54,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 373. [2022-01-30 22:46:54,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 339 states have (on average 1.3628318584070795) internal successors, (462), 343 states have internal predecessors, (462), 21 states have call successors, (21), 14 states have call predecessors, (21), 12 states have return successors, (20), 15 states have call predecessors, (20), 20 states have call successors, (20) [2022-01-30 22:46:54,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 503 transitions. [2022-01-30 22:46:54,210 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 503 transitions. Word has length 73 [2022-01-30 22:46:54,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:46:54,211 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 503 transitions. [2022-01-30 22:46:54,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 2.574468085106383) internal successors, (121), 46 states have internal predecessors, (121), 13 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-01-30 22:46:54,211 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 503 transitions. [2022-01-30 22:46:54,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-30 22:46:54,212 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:46:54,212 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:46:54,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-01-30 22:46:54,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-30 22:46:54,428 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:46:54,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:46:54,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1477199917, now seen corresponding path program 2 times [2022-01-30 22:46:54,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:46:54,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179368375] [2022-01-30 22:46:54,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:46:54,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:46:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:46:54,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:46:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:46:54,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-30 22:46:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:46:54,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-30 22:46:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:46:54,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-30 22:46:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:46:54,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-30 22:46:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:46:54,789 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 31 proven. 42 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-30 22:46:54,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:46:54,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179368375] [2022-01-30 22:46:54,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179368375] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:46:54,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551142653] [2022-01-30 22:46:54,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-30 22:46:54,790 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:46:54,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:46:54,791 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:46:54,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-01-30 22:46:54,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-30 22:46:54,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:46:54,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-30 22:46:54,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:46:55,310 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 36 proven. 31 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-01-30 22:46:55,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:46:55,961 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 55 proven. 18 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-30 22:46:55,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551142653] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:46:55,961 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:46:55,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 41 [2022-01-30 22:46:55,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955023120] [2022-01-30 22:46:55,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:46:55,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-30 22:46:55,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:46:55,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-30 22:46:55,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=1302, Unknown=0, NotChecked=0, Total=1640 [2022-01-30 22:46:55,962 INFO L87 Difference]: Start difference. First operand 373 states and 503 transitions. Second operand has 41 states, 41 states have (on average 3.024390243902439) internal successors, (124), 40 states have internal predecessors, (124), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-30 22:46:57,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:46:57,533 INFO L93 Difference]: Finished difference Result 866 states and 1119 transitions. [2022-01-30 22:46:57,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-30 22:46:57,533 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.024390243902439) internal successors, (124), 40 states have internal predecessors, (124), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 75 [2022-01-30 22:46:57,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:46:57,536 INFO L225 Difference]: With dead ends: 866 [2022-01-30 22:46:57,536 INFO L226 Difference]: Without dead ends: 791 [2022-01-30 22:46:57,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=938, Invalid=3352, Unknown=0, NotChecked=0, Total=4290 [2022-01-30 22:46:57,538 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 278 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 2422 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 2640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 2422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-30 22:46:57,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 311 Invalid, 2640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 2422 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-30 22:46:57,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2022-01-30 22:46:57,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 503. [2022-01-30 22:46:57,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 445 states have (on average 1.3056179775280898) internal successors, (581), 453 states have internal predecessors, (581), 34 states have call successors, (34), 25 states have call predecessors, (34), 23 states have return successors, (33), 24 states have call predecessors, (33), 33 states have call successors, (33) [2022-01-30 22:46:57,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 648 transitions. [2022-01-30 22:46:57,639 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 648 transitions. Word has length 75 [2022-01-30 22:46:57,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:46:57,639 INFO L470 AbstractCegarLoop]: Abstraction has 503 states and 648 transitions. [2022-01-30 22:46:57,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.024390243902439) internal successors, (124), 40 states have internal predecessors, (124), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-30 22:46:57,640 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 648 transitions. [2022-01-30 22:46:57,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-01-30 22:46:57,641 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:46:57,641 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:46:57,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-01-30 22:46:57,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:46:57,855 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:46:57,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:46:57,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1525741405, now seen corresponding path program 7 times [2022-01-30 22:46:57,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:46:57,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026102586] [2022-01-30 22:46:57,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:46:57,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:46:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:46:58,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:46:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:46:58,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-30 22:46:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:46:58,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-01-30 22:46:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:46:58,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-30 22:46:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:46:58,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-01-30 22:46:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:46:58,219 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 29 proven. 47 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-30 22:46:58,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:46:58,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026102586] [2022-01-30 22:46:58,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026102586] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:46:58,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115131826] [2022-01-30 22:46:58,219 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-30 22:46:58,220 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:46:58,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:46:58,224 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:46:58,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-01-30 22:46:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:46:58,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-30 22:46:58,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:46:58,699 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 34 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-01-30 22:46:58,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:46:59,213 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 40 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-30 22:46:59,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115131826] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:46:59,213 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:46:59,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 41 [2022-01-30 22:46:59,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911624039] [2022-01-30 22:46:59,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:46:59,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-30 22:46:59,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:46:59,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-30 22:46:59,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1318, Unknown=0, NotChecked=0, Total=1640 [2022-01-30 22:46:59,215 INFO L87 Difference]: Start difference. First operand 503 states and 648 transitions. Second operand has 41 states, 40 states have (on average 3.075) internal successors, (123), 39 states have internal predecessors, (123), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-30 22:47:00,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:47:00,119 INFO L93 Difference]: Finished difference Result 840 states and 1068 transitions. [2022-01-30 22:47:00,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-30 22:47:00,119 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.075) internal successors, (123), 39 states have internal predecessors, (123), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 78 [2022-01-30 22:47:00,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:47:00,121 INFO L225 Difference]: With dead ends: 840 [2022-01-30 22:47:00,121 INFO L226 Difference]: Without dead ends: 423 [2022-01-30 22:47:00,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=647, Invalid=2215, Unknown=0, NotChecked=0, Total=2862 [2022-01-30 22:47:00,123 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 430 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-30 22:47:00,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [438 Valid, 99 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-30 22:47:00,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-01-30 22:47:00,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 348. [2022-01-30 22:47:00,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 303 states have (on average 1.2508250825082508) internal successors, (379), 308 states have internal predecessors, (379), 26 states have call successors, (26), 20 states have call predecessors, (26), 18 states have return successors, (25), 19 states have call predecessors, (25), 25 states have call successors, (25) [2022-01-30 22:47:00,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 430 transitions. [2022-01-30 22:47:00,222 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 430 transitions. Word has length 78 [2022-01-30 22:47:00,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:47:00,223 INFO L470 AbstractCegarLoop]: Abstraction has 348 states and 430 transitions. [2022-01-30 22:47:00,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.075) internal successors, (123), 39 states have internal predecessors, (123), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-30 22:47:00,223 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 430 transitions. [2022-01-30 22:47:00,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-30 22:47:00,224 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:47:00,224 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:47:00,245 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-01-30 22:47:00,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:47:00,439 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:47:00,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:47:00,440 INFO L85 PathProgramCache]: Analyzing trace with hash -718038558, now seen corresponding path program 4 times [2022-01-30 22:47:00,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:47:00,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759717242] [2022-01-30 22:47:00,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:47:00,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:47:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:47:01,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:47:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:47:01,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-30 22:47:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:47:01,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-30 22:47:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:47:01,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-30 22:47:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:47:01,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-30 22:47:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:47:01,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-30 22:47:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:47:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 8 proven. 86 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-30 22:47:01,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:47:01,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759717242] [2022-01-30 22:47:01,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759717242] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:47:01,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124890301] [2022-01-30 22:47:01,169 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-30 22:47:01,169 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:47:01,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:47:01,172 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:47:01,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-01-30 22:47:01,250 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-30 22:47:01,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:47:01,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-30 22:47:01,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:47:01,353 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-01-30 22:47:01,392 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-01-30 22:47:01,392 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-01-30 22:47:29,136 INFO L353 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-01-30 22:47:29,136 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2022-01-30 22:47:29,201 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-01-30 22:47:29,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:47:31,330 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-01-30 22:47:31,332 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2022-01-30 22:47:31,415 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 8 proven. 50 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-01-30 22:47:31,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124890301] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:47:31,415 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:47:31,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15, 14] total 37 [2022-01-30 22:47:31,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863082198] [2022-01-30 22:47:31,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:47:31,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-30 22:47:31,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:47:31,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-30 22:47:31,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1208, Unknown=5, NotChecked=0, Total=1332 [2022-01-30 22:47:31,416 INFO L87 Difference]: Start difference. First operand 348 states and 430 transitions. Second operand has 37 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 34 states have internal predecessors, (104), 12 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-01-30 22:48:10,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:48:10,581 INFO L93 Difference]: Finished difference Result 1312 states and 1767 transitions. [2022-01-30 22:48:10,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-01-30 22:48:10,582 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 34 states have internal predecessors, (104), 12 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 81 [2022-01-30 22:48:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:48:10,586 INFO L225 Difference]: With dead ends: 1312 [2022-01-30 22:48:10,586 INFO L226 Difference]: Without dead ends: 1310 [2022-01-30 22:48:10,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 166 SyntacticMatches, 12 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3660 ImplicationChecksByTransitivity, 67.9s TimeCoverageRelationStatistics Valid=1085, Invalid=10874, Unknown=31, NotChecked=0, Total=11990 [2022-01-30 22:48:10,588 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 772 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 2272 mSolverCounterSat, 543 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 3088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 543 IncrementalHoareTripleChecker+Valid, 2272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-30 22:48:10,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [773 Valid, 473 Invalid, 3088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [543 Valid, 2272 Invalid, 0 Unknown, 273 Unchecked, 1.2s Time] [2022-01-30 22:48:10,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2022-01-30 22:48:10,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 536. [2022-01-30 22:48:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 470 states have (on average 1.274468085106383) internal successors, (599), 478 states have internal predecessors, (599), 40 states have call successors, (40), 28 states have call predecessors, (40), 25 states have return successors, (39), 29 states have call predecessors, (39), 39 states have call successors, (39) [2022-01-30 22:48:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 678 transitions. [2022-01-30 22:48:10,716 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 678 transitions. Word has length 81 [2022-01-30 22:48:10,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:48:10,716 INFO L470 AbstractCegarLoop]: Abstraction has 536 states and 678 transitions. [2022-01-30 22:48:10,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 34 states have internal predecessors, (104), 12 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-01-30 22:48:10,716 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 678 transitions. [2022-01-30 22:48:10,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-30 22:48:10,718 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:48:10,718 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2022-01-30 22:48:10,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-01-30 22:48:10,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:48:10,941 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:48:10,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:48:10,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1615431836, now seen corresponding path program 3 times [2022-01-30 22:48:10,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:48:10,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856467788] [2022-01-30 22:48:10,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:48:10,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:48:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:48:11,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:48:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:48:11,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-30 22:48:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:48:11,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-30 22:48:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:48:11,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-30 22:48:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:48:11,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-30 22:48:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:48:11,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-30 22:48:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:48:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 8 proven. 86 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-30 22:48:11,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:48:11,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856467788] [2022-01-30 22:48:11,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856467788] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:48:11,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233286446] [2022-01-30 22:48:11,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-30 22:48:11,840 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:48:11,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:48:11,844 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:48:11,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-01-30 22:48:12,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-30 22:48:12,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:48:12,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-30 22:48:12,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:48:12,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:48:12,294 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-30 22:48:12,925 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-30 22:48:12,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:48:12,928 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-30 22:48:12,928 INFO L387 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 3 case distinctions, treesize of input 24 treesize of output 13 [2022-01-30 22:48:13,001 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-01-30 22:48:13,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:48:13,163 INFO L353 Elim1Store]: treesize reduction 10, result has 33.3 percent of original size [2022-01-30 22:48:13,164 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-01-30 22:48:13,272 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 8 proven. 50 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-01-30 22:48:13,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233286446] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:48:13,272 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:48:13,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18, 15] total 47 [2022-01-30 22:48:13,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730810697] [2022-01-30 22:48:13,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:48:13,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-30 22:48:13,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:48:13,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-30 22:48:13,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1964, Unknown=0, NotChecked=0, Total=2162 [2022-01-30 22:48:13,274 INFO L87 Difference]: Start difference. First operand 536 states and 678 transitions. Second operand has 47 states, 45 states have (on average 2.8) internal successors, (126), 44 states have internal predecessors, (126), 14 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-01-30 22:48:16,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:48:16,924 INFO L93 Difference]: Finished difference Result 1568 states and 2090 transitions. [2022-01-30 22:48:16,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-01-30 22:48:16,926 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 45 states have (on average 2.8) internal successors, (126), 44 states have internal predecessors, (126), 14 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 81 [2022-01-30 22:48:16,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:48:16,931 INFO L225 Difference]: With dead ends: 1568 [2022-01-30 22:48:16,931 INFO L226 Difference]: Without dead ends: 1566 [2022-01-30 22:48:16,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 158 SyntacticMatches, 11 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3545 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1116, Invalid=11094, Unknown=0, NotChecked=0, Total=12210 [2022-01-30 22:48:16,933 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 824 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 2562 mSolverCounterSat, 625 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 3461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 625 IncrementalHoareTripleChecker+Valid, 2562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 274 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-30 22:48:16,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [824 Valid, 506 Invalid, 3461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [625 Valid, 2562 Invalid, 0 Unknown, 274 Unchecked, 1.2s Time] [2022-01-30 22:48:16,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2022-01-30 22:48:17,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 786. [2022-01-30 22:48:17,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 665 states have (on average 1.2255639097744362) internal successors, (815), 681 states have internal predecessors, (815), 74 states have call successors, (74), 49 states have call predecessors, (74), 46 states have return successors, (73), 55 states have call predecessors, (73), 73 states have call successors, (73) [2022-01-30 22:48:17,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 962 transitions. [2022-01-30 22:48:17,140 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 962 transitions. Word has length 81 [2022-01-30 22:48:17,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:48:17,141 INFO L470 AbstractCegarLoop]: Abstraction has 786 states and 962 transitions. [2022-01-30 22:48:17,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 45 states have (on average 2.8) internal successors, (126), 44 states have internal predecessors, (126), 14 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-01-30 22:48:17,141 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 962 transitions. [2022-01-30 22:48:17,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-30 22:48:17,143 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:48:17,143 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:48:17,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-01-30 22:48:17,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-01-30 22:48:17,360 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:48:17,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:48:17,360 INFO L85 PathProgramCache]: Analyzing trace with hash -852045417, now seen corresponding path program 8 times [2022-01-30 22:48:17,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:48:17,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730077510] [2022-01-30 22:48:17,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:48:17,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:48:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:48:19,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:48:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:48:19,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-30 22:48:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:48:19,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-30 22:48:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:48:19,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-30 22:48:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:48:19,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-01-30 22:48:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:48:19,170 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 18 proven. 104 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-30 22:48:19,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:48:19,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730077510] [2022-01-30 22:48:19,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730077510] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:48:19,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581253588] [2022-01-30 22:48:19,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-30 22:48:19,171 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:48:19,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:48:19,176 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:48:19,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-01-30 22:48:19,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-30 22:48:19,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:48:19,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-30 22:48:19,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:48:19,521 INFO L353 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-01-30 22:48:19,522 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-01-30 22:48:19,540 INFO L353 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-01-30 22:48:19,541 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-01-30 22:48:19,583 INFO L353 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-01-30 22:48:19,583 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-01-30 22:48:19,599 INFO L353 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-01-30 22:48:19,599 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-01-30 22:48:25,959 INFO L353 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-01-30 22:48:25,960 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2022-01-30 22:48:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 4 proven. 93 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-01-30 22:48:26,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:48:36,430 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_267 Int)) (or (forall ((v_ArrVal_786 Int)) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_267) (- 4)) v_ArrVal_786) (+ c_main_~a~0.offset 12)) 3)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_267)))) is different from false [2022-01-30 22:48:59,948 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_268 Int)) (or (forall ((v_main_~i~0_267 Int) (v_ArrVal_786 Int) (v_ArrVal_781 Int) (v_ArrVal_779 Int)) (or (<= (select (store (let ((.cse0 (* 8 v_main_~i~0_268))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset (- 8)) v_ArrVal_779) (+ .cse0 c_main_~a~0.offset (- 4)) v_ArrVal_781)) (+ c_main_~a~0.offset (* 8 v_main_~i~0_267) (- 4)) v_ArrVal_786) (+ c_main_~a~0.offset 12)) 3) (not (<= (+ v_main_~i~0_268 1) v_main_~i~0_267)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_268)))) is different from false [2022-01-30 22:49:02,057 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-01-30 22:49:02,066 INFO L353 Elim1Store]: treesize reduction 10, result has 33.3 percent of original size [2022-01-30 22:49:02,066 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 430 treesize of output 420 [2022-01-30 22:49:02,305 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 7 proven. 42 refuted. 4 times theorem prover too weak. 76 trivial. 5 not checked. [2022-01-30 22:49:02,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581253588] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:49:02,305 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:49:02,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 17, 18] total 56 [2022-01-30 22:49:02,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476905951] [2022-01-30 22:49:02,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:49:02,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-01-30 22:49:02,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:49:02,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-01-30 22:49:02,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=2566, Unknown=51, NotChecked=210, Total=3080 [2022-01-30 22:49:02,307 INFO L87 Difference]: Start difference. First operand 786 states and 962 transitions. Second operand has 56 states, 54 states have (on average 2.5555555555555554) internal successors, (138), 53 states have internal predecessors, (138), 13 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-01-30 22:49:11,582 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base))) (and (forall ((v_main_~i~0_268 Int)) (or (forall ((v_main_~i~0_267 Int) (v_ArrVal_786 Int) (v_ArrVal_781 Int) (v_ArrVal_779 Int)) (or (<= (select (store (let ((.cse0 (* 8 v_main_~i~0_268))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset (- 8)) v_ArrVal_779) (+ .cse0 c_main_~a~0.offset (- 4)) v_ArrVal_781)) (+ c_main_~a~0.offset (* 8 v_main_~i~0_267) (- 4)) v_ArrVal_786) (+ c_main_~a~0.offset 12)) 3) (not (<= (+ v_main_~i~0_268 1) v_main_~i~0_267)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_268)))) (<= (+ (select .cse1 (+ c_main_~a~0.offset (* c_main_~i~0 8) (- 4))) 1) (* c_main_~i~0 2)) (= c_main_~i~0 2) (<= (select .cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset)) c_main_~i~0) (or (not (= (+ (* (- 2) (div c_~SIZE~0 2)) c_~SIZE~0) 0)) (and (<= 2 c_main_~i~0) (<= 2 c_~SIZE~0) (= c_main_~a~0.offset 0) (<= c_main_~i~0 2))))) is different from false [2022-01-30 22:49:13,622 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_268 Int)) (or (forall ((v_main_~i~0_267 Int) (v_ArrVal_786 Int) (v_ArrVal_781 Int) (v_ArrVal_779 Int)) (or (<= (select (store (let ((.cse0 (* 8 v_main_~i~0_268))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset (- 8)) v_ArrVal_779) (+ .cse0 c_main_~a~0.offset (- 4)) v_ArrVal_781)) (+ c_main_~a~0.offset (* 8 v_main_~i~0_267) (- 4)) v_ArrVal_786) (+ c_main_~a~0.offset 12)) 3) (not (<= (+ v_main_~i~0_268 1) v_main_~i~0_267)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_268)))) (<= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8) (- 4))) 1) (* c_main_~i~0 2)) (= c_main_~i~0 2) (or (not (= (+ (* (- 2) (div c_~SIZE~0 2)) c_~SIZE~0) 0)) (and (<= 2 c_main_~i~0) (<= 2 c_~SIZE~0) (= c_main_~a~0.offset 0) (<= c_main_~i~0 2)))) is different from false [2022-01-30 22:49:15,955 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_main_~a~0.base)) (.cse6 (* c_main_~i~0 8))) (let ((.cse1 (select .cse4 (+ c_main_~a~0.offset .cse6 (- 4)))) (.cse3 (= (+ (* (- 2) (div c_~SIZE~0 2)) c_~SIZE~0) 0)) (.cse2 (= c_main_~a~0.offset 0)) (.cse5 (<= c_main_~i~0 2))) (and (forall ((v_main_~i~0_268 Int)) (or (forall ((v_main_~i~0_267 Int) (v_ArrVal_786 Int) (v_ArrVal_781 Int) (v_ArrVal_779 Int)) (or (<= (select (store (let ((.cse0 (* 8 v_main_~i~0_268))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset (- 8)) v_ArrVal_779) (+ .cse0 c_main_~a~0.offset (- 4)) v_ArrVal_781)) (+ c_main_~a~0.offset (* 8 v_main_~i~0_267) (- 4)) v_ArrVal_786) (+ c_main_~a~0.offset 12)) 3) (not (<= (+ v_main_~i~0_268 1) v_main_~i~0_267)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_268)))) (<= (+ .cse1 1) (* c_main_~i~0 2)) (= c_main_~i~0 2) (<= 8 c_~SIZE~0) .cse2 .cse3 (<= (select .cse4 (+ (* c_main_~i~0 4) c_main_~a~0.offset)) c_main_~i~0) (<= (select .cse4 12) 3) .cse5 (or (<= (+ c_main_~a~0.offset .cse6 17) (* 4 c_~SIZE~0)) (<= .cse1 3)) (or (not .cse3) (and (<= 2 c_main_~i~0) (<= 2 c_~SIZE~0) .cse2 .cse5))))) is different from false [2022-01-30 22:49:18,000 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_main_~a~0.base)) (.cse6 (* c_main_~i~0 8))) (let ((.cse1 (select .cse4 (+ c_main_~a~0.offset .cse6 (- 4)))) (.cse3 (= (+ (* (- 2) (div c_~SIZE~0 2)) c_~SIZE~0) 0)) (.cse2 (= c_main_~a~0.offset 0)) (.cse5 (<= c_main_~i~0 2))) (and (forall ((v_main_~i~0_268 Int)) (or (forall ((v_main_~i~0_267 Int) (v_ArrVal_786 Int) (v_ArrVal_781 Int) (v_ArrVal_779 Int)) (or (<= (select (store (let ((.cse0 (* 8 v_main_~i~0_268))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset (- 8)) v_ArrVal_779) (+ .cse0 c_main_~a~0.offset (- 4)) v_ArrVal_781)) (+ c_main_~a~0.offset (* 8 v_main_~i~0_267) (- 4)) v_ArrVal_786) (+ c_main_~a~0.offset 12)) 3) (not (<= (+ v_main_~i~0_268 1) v_main_~i~0_267)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_268)))) (<= (+ .cse1 1) (* c_main_~i~0 2)) (= c_main_~i~0 2) (<= 8 c_~SIZE~0) .cse2 .cse3 (<= (select .cse4 12) 3) .cse5 (or (<= (+ c_main_~a~0.offset .cse6 17) (* 4 c_~SIZE~0)) (<= .cse1 3)) (or (not .cse3) (and (<= 2 c_main_~i~0) (<= 2 c_~SIZE~0) .cse2 .cse5))))) is different from false [2022-01-30 22:49:20,015 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= 3 c_main_~i~0))) (and (forall ((v_main_~i~0_267 Int)) (or (forall ((v_ArrVal_786 Int)) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_267) (- 4)) v_ArrVal_786) (+ c_main_~a~0.offset 12)) 3)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_267)))) .cse0 (or (and (<= c_main_~i~0 3) (<= 2 c_~SIZE~0) (= c_main_~a~0.offset 0) .cse0) (not (= (+ (* (- 2) (div c_~SIZE~0 2)) c_~SIZE~0) 0))) (<= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 3))) is different from false [2022-01-30 22:49:22,028 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (<= 3 c_main_~i~0))) (and (forall ((v_main_~i~0_268 Int)) (or (forall ((v_main_~i~0_267 Int) (v_ArrVal_786 Int) (v_ArrVal_781 Int) (v_ArrVal_779 Int)) (or (<= (select (store (let ((.cse0 (* 8 v_main_~i~0_268))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset (- 8)) v_ArrVal_779) (+ .cse0 c_main_~a~0.offset (- 4)) v_ArrVal_781)) (+ c_main_~a~0.offset (* 8 v_main_~i~0_267) (- 4)) v_ArrVal_786) (+ c_main_~a~0.offset 12)) 3) (not (<= (+ v_main_~i~0_268 1) v_main_~i~0_267)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_268)))) .cse1 (or (and (<= c_main_~i~0 3) (<= 2 c_~SIZE~0) (= c_main_~a~0.offset 0) .cse1) (not (= (+ (* (- 2) (div c_~SIZE~0 2)) c_~SIZE~0) 0))) (<= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 3))) is different from false [2022-01-30 22:49:24,032 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_267 Int)) (or (forall ((v_ArrVal_786 Int)) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_267) (- 4)) v_ArrVal_786) (+ c_main_~a~0.offset 12)) 3)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_267)))) (<= 3 c_main_~i~0) (<= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 3)) is different from false [2022-01-30 22:49:26,035 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_268 Int)) (or (forall ((v_main_~i~0_267 Int) (v_ArrVal_786 Int) (v_ArrVal_781 Int) (v_ArrVal_779 Int)) (or (<= (select (store (let ((.cse0 (* 8 v_main_~i~0_268))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset (- 8)) v_ArrVal_779) (+ .cse0 c_main_~a~0.offset (- 4)) v_ArrVal_781)) (+ c_main_~a~0.offset (* 8 v_main_~i~0_267) (- 4)) v_ArrVal_786) (+ c_main_~a~0.offset 12)) 3) (not (<= (+ v_main_~i~0_268 1) v_main_~i~0_267)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_268)))) (<= 3 c_main_~i~0) (<= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 3)) is different from false [2022-01-30 22:49:28,327 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (div c_~SIZE~0 2)) (.cse5 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse6 (* c_main_~i~0 4)) (.cse2 (<= (select .cse5 12) 3)) (.cse3 (= c_main_~a~0.offset 0)) (.cse7 (<= 3 c_main_~i~0)) (.cse4 (= (+ (* (- 2) .cse0) c_~SIZE~0) 0))) (and (= (* 2 .cse0) c_~SIZE~0) (<= 8 c_~SIZE~0) (let ((.cse1 (* c_main_~i~0 2))) (or (and (not (= 16 (+ c_main_~a~0.offset (* 4 c_~SIZE~0)))) (not (= (+ c_main_~a~0.offset (* c_main_~i~0 8) (- 4)) 12)) (<= (+ 2 .cse1) c_~SIZE~0) .cse2) (<= (+ 3 .cse1) c_~SIZE~0))) .cse3 .cse4 (<= (select .cse5 (+ .cse6 c_main_~a~0.offset 8)) (+ c_main_~i~0 2)) (<= (select .cse5 (+ .cse6 c_main_~a~0.offset)) c_main_~i~0) (<= (select .cse5 (+ .cse6 c_main_~a~0.offset 4)) (+ c_main_~i~0 1)) .cse2 (forall ((v_main_~i~0_267 Int)) (or (forall ((v_ArrVal_786 Int)) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_267) (- 4)) v_ArrVal_786) (+ c_main_~a~0.offset 12)) 3)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_267)))) .cse7 (or (and (<= c_main_~i~0 3) (<= 2 c_~SIZE~0) .cse3 .cse7) (not .cse4)) (<= (select .cse5 (+ c_main_~a~0.offset 12)) 3)))) is different from false [2022-01-30 22:49:30,338 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (div c_~SIZE~0 2)) (.cse6 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse7 (* c_main_~i~0 4)) (.cse3 (<= (select .cse6 12) 3)) (.cse4 (= c_main_~a~0.offset 0)) (.cse5 (= (+ (* (- 2) .cse0) c_~SIZE~0) 0))) (and (= (* 2 .cse0) c_~SIZE~0) (forall ((v_main_~i~0_268 Int)) (or (forall ((v_main_~i~0_267 Int) (v_ArrVal_786 Int) (v_ArrVal_781 Int) (v_ArrVal_779 Int)) (or (<= (select (store (let ((.cse1 (* 8 v_main_~i~0_268))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset (- 8)) v_ArrVal_779) (+ .cse1 c_main_~a~0.offset (- 4)) v_ArrVal_781)) (+ c_main_~a~0.offset (* 8 v_main_~i~0_267) (- 4)) v_ArrVal_786) (+ c_main_~a~0.offset 12)) 3) (not (<= (+ v_main_~i~0_268 1) v_main_~i~0_267)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_268)))) (<= 8 c_~SIZE~0) (let ((.cse2 (* c_main_~i~0 2))) (or (and (not (= 16 (+ c_main_~a~0.offset (* 4 c_~SIZE~0)))) (not (= (+ c_main_~a~0.offset (* c_main_~i~0 8) (- 4)) 12)) (<= (+ 2 .cse2) c_~SIZE~0) .cse3) (<= (+ 3 .cse2) c_~SIZE~0))) (= c_main_~i~0 3) .cse4 .cse5 (<= (select .cse6 (+ .cse7 c_main_~a~0.offset)) c_main_~i~0) (<= (select .cse6 (+ .cse7 c_main_~a~0.offset 4)) (+ c_main_~i~0 1)) .cse3 (or (and (<= c_main_~i~0 3) (<= 2 c_~SIZE~0) .cse4 (<= 3 c_main_~i~0)) (not .cse5)) (<= (select .cse6 (+ c_main_~a~0.offset 12)) 3)))) is different from false [2022-01-30 22:49:32,345 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (div c_~SIZE~0 2)) (.cse5 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse6 (* c_main_~i~0 4)) (.cse2 (<= (select .cse5 12) 3)) (.cse3 (= c_main_~a~0.offset 0)) (.cse7 (<= 3 c_main_~i~0)) (.cse4 (= (+ (* (- 2) .cse0) c_~SIZE~0) 0))) (and (= (* 2 .cse0) c_~SIZE~0) (<= 8 c_~SIZE~0) (let ((.cse1 (* c_main_~i~0 2))) (or (and (not (= 16 (+ c_main_~a~0.offset (* 4 c_~SIZE~0)))) (not (= (+ c_main_~a~0.offset (* c_main_~i~0 8) (- 4)) 12)) (<= (+ 2 .cse1) c_~SIZE~0) .cse2) (<= (+ 3 .cse1) c_~SIZE~0))) .cse3 .cse4 (<= (select .cse5 (+ .cse6 c_main_~a~0.offset 8)) (+ c_main_~i~0 2)) (<= (select .cse5 (+ .cse6 c_main_~a~0.offset)) c_main_~i~0) .cse2 (forall ((v_main_~i~0_267 Int)) (or (forall ((v_ArrVal_786 Int)) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_267) (- 4)) v_ArrVal_786) (+ c_main_~a~0.offset 12)) 3)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_267)))) .cse7 (or (and (<= c_main_~i~0 3) (<= 2 c_~SIZE~0) .cse3 .cse7) (not .cse4)) (<= (select .cse5 (+ c_main_~a~0.offset 12)) 3)))) is different from false [2022-01-30 22:49:34,350 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (div c_~SIZE~0 2)) (.cse6 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse3 (<= (select .cse6 12) 3)) (.cse4 (= c_main_~a~0.offset 0)) (.cse5 (= (+ (* (- 2) .cse0) c_~SIZE~0) 0))) (and (= (* 2 .cse0) c_~SIZE~0) (forall ((v_main_~i~0_268 Int)) (or (forall ((v_main_~i~0_267 Int) (v_ArrVal_786 Int) (v_ArrVal_781 Int) (v_ArrVal_779 Int)) (or (<= (select (store (let ((.cse1 (* 8 v_main_~i~0_268))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset (- 8)) v_ArrVal_779) (+ .cse1 c_main_~a~0.offset (- 4)) v_ArrVal_781)) (+ c_main_~a~0.offset (* 8 v_main_~i~0_267) (- 4)) v_ArrVal_786) (+ c_main_~a~0.offset 12)) 3) (not (<= (+ v_main_~i~0_268 1) v_main_~i~0_267)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_268)))) (<= 8 c_~SIZE~0) (let ((.cse2 (* c_main_~i~0 2))) (or (and (not (= 16 (+ c_main_~a~0.offset (* 4 c_~SIZE~0)))) (not (= (+ c_main_~a~0.offset (* c_main_~i~0 8) (- 4)) 12)) (<= (+ 2 .cse2) c_~SIZE~0) .cse3) (<= (+ 3 .cse2) c_~SIZE~0))) (= c_main_~i~0 3) .cse4 .cse5 (<= (select .cse6 (+ (* c_main_~i~0 4) c_main_~a~0.offset)) c_main_~i~0) .cse3 (or (and (<= c_main_~i~0 3) (<= 2 c_~SIZE~0) .cse4 (<= 3 c_main_~i~0)) (not .cse5)) (<= (select .cse6 (+ c_main_~a~0.offset 12)) 3)))) is different from false [2022-01-30 22:49:36,358 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse0 (div c_~SIZE~0 2)) (.cse2 (<= (select .cse3 12) 3))) (and (= (* 2 .cse0) c_~SIZE~0) (<= 8 c_~SIZE~0) (let ((.cse1 (* c_main_~i~0 2))) (or (and (not (= 16 (+ c_main_~a~0.offset (* 4 c_~SIZE~0)))) (not (= (+ c_main_~a~0.offset (* c_main_~i~0 8) (- 4)) 12)) (<= (+ 2 .cse1) c_~SIZE~0) .cse2) (<= (+ 3 .cse1) c_~SIZE~0))) (= c_main_~a~0.offset 0) (= (+ (* (- 2) .cse0) c_~SIZE~0) 0) .cse2 (forall ((v_main_~i~0_267 Int)) (or (forall ((v_ArrVal_786 Int)) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_267) (- 4)) v_ArrVal_786) (+ c_main_~a~0.offset 12)) 3)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_267)))) (<= 3 c_main_~i~0) (<= (select .cse3 (+ c_main_~a~0.offset 12)) 3)))) is different from false [2022-01-30 22:49:38,363 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse0 (div c_~SIZE~0 2)) (.cse3 (<= (select .cse4 12) 3))) (and (= (* 2 .cse0) c_~SIZE~0) (forall ((v_main_~i~0_268 Int)) (or (forall ((v_main_~i~0_267 Int) (v_ArrVal_786 Int) (v_ArrVal_781 Int) (v_ArrVal_779 Int)) (or (<= (select (store (let ((.cse1 (* 8 v_main_~i~0_268))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset (- 8)) v_ArrVal_779) (+ .cse1 c_main_~a~0.offset (- 4)) v_ArrVal_781)) (+ c_main_~a~0.offset (* 8 v_main_~i~0_267) (- 4)) v_ArrVal_786) (+ c_main_~a~0.offset 12)) 3) (not (<= (+ v_main_~i~0_268 1) v_main_~i~0_267)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_268)))) (<= 8 c_~SIZE~0) (let ((.cse2 (* c_main_~i~0 2))) (or (and (not (= 16 (+ c_main_~a~0.offset (* 4 c_~SIZE~0)))) (not (= (+ c_main_~a~0.offset (* c_main_~i~0 8) (- 4)) 12)) (<= (+ 2 .cse2) c_~SIZE~0) .cse3) (<= (+ 3 .cse2) c_~SIZE~0))) (= c_main_~a~0.offset 0) (= (+ (* (- 2) .cse0) c_~SIZE~0) 0) .cse3 (<= 3 c_main_~i~0) (<= (select .cse4 (+ c_main_~a~0.offset 12)) 3)))) is different from false [2022-01-30 22:49:40,519 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (div c_~SIZE~0 2)) (.cse5 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse3 (<= (select .cse5 12) 3)) (.cse1 (= c_main_~a~0.offset 0)) (.cse2 (= (+ (* (- 2) .cse0) c_~SIZE~0) 0))) (and (= (* 2 .cse0) c_~SIZE~0) (<= 8 c_~SIZE~0) .cse1 .cse2 .cse3 (forall ((v_main_~i~0_267 Int)) (or (forall ((v_ArrVal_786 Int)) (<= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_267) (- 4)) v_ArrVal_786) (+ c_main_~a~0.offset 12)) 3)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_267)))) (<= 3 c_main_~i~0) (let ((.cse4 (* c_main_~i~0 8))) (or (and (not (= (+ c_main_~a~0.offset .cse4 (- 4)) 12)) .cse3) (<= (+ c_main_~a~0.offset .cse4 1) (* 4 c_~SIZE~0)))) (<= (select .cse5 (+ c_main_~a~0.offset 12)) 3) (or (and (<= 2 c_~SIZE~0) (<= 4 c_main_~i~0) .cse1) (not .cse2))))) is different from false [2022-01-30 22:49:42,533 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (div c_~SIZE~0 2)) (.cse7 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse5 (<= (select .cse7 12) 3)) (.cse2 (<= 4 c_main_~i~0)) (.cse3 (= c_main_~a~0.offset 0)) (.cse4 (= (+ (* (- 2) .cse0) c_~SIZE~0) 0))) (and (= (* 2 .cse0) c_~SIZE~0) (forall ((v_main_~i~0_268 Int)) (or (forall ((v_main_~i~0_267 Int) (v_ArrVal_786 Int) (v_ArrVal_781 Int) (v_ArrVal_779 Int)) (or (<= (select (store (let ((.cse1 (* 8 v_main_~i~0_268))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset (- 8)) v_ArrVal_779) (+ .cse1 c_main_~a~0.offset (- 4)) v_ArrVal_781)) (+ c_main_~a~0.offset (* 8 v_main_~i~0_267) (- 4)) v_ArrVal_786) (+ c_main_~a~0.offset 12)) 3) (not (<= (+ v_main_~i~0_268 1) v_main_~i~0_267)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_268)))) (<= 8 c_~SIZE~0) .cse2 .cse3 .cse4 .cse5 (let ((.cse6 (* c_main_~i~0 8))) (or (and (not (= (+ c_main_~a~0.offset .cse6 (- 4)) 12)) .cse5) (<= (+ c_main_~a~0.offset .cse6 1) (* 4 c_~SIZE~0)))) (<= (select .cse7 (+ c_main_~a~0.offset 12)) 3) (or (and (<= 2 c_~SIZE~0) .cse2 .cse3) (not .cse4))))) is different from false [2022-01-30 22:49:43,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:49:43,743 INFO L93 Difference]: Finished difference Result 905 states and 1100 transitions. [2022-01-30 22:49:43,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-01-30 22:49:43,743 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 54 states have (on average 2.5555555555555554) internal successors, (138), 53 states have internal predecessors, (138), 13 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 82 [2022-01-30 22:49:43,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:49:43,746 INFO L225 Difference]: With dead ends: 905 [2022-01-30 22:49:43,746 INFO L226 Difference]: Without dead ends: 903 [2022-01-30 22:49:43,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 157 SyntacticMatches, 17 SemanticMatches, 111 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 3169 ImplicationChecksByTransitivity, 82.8s TimeCoverageRelationStatistics Valid=909, Invalid=8022, Unknown=71, NotChecked=3654, Total=12656 [2022-01-30 22:49:43,748 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 236 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 3224 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 4002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 3224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 587 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-30 22:49:43,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 654 Invalid, 4002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 3224 Invalid, 0 Unknown, 587 Unchecked, 1.3s Time] [2022-01-30 22:49:43,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2022-01-30 22:49:43,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 365. [2022-01-30 22:49:43,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 307 states have (on average 1.1954397394136809) internal successors, (367), 314 states have internal predecessors, (367), 31 states have call successors, (31), 27 states have call predecessors, (31), 26 states have return successors, (30), 23 states have call predecessors, (30), 30 states have call successors, (30) [2022-01-30 22:49:43,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 428 transitions. [2022-01-30 22:49:43,897 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 428 transitions. Word has length 82 [2022-01-30 22:49:43,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:49:43,897 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 428 transitions. [2022-01-30 22:49:43,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 54 states have (on average 2.5555555555555554) internal successors, (138), 53 states have internal predecessors, (138), 13 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-01-30 22:49:43,898 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 428 transitions. [2022-01-30 22:49:43,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-01-30 22:49:43,899 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:49:43,899 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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] [2022-01-30 22:49:43,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-01-30 22:49:44,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-01-30 22:49:44,130 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:49:44,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:49:44,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1284849641, now seen corresponding path program 9 times [2022-01-30 22:49:44,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:49:44,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165901679] [2022-01-30 22:49:44,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:49:44,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:49:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:49:44,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:49:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:49:44,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-30 22:49:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:49:44,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-30 22:49:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:49:44,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-30 22:49:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:49:44,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-30 22:49:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:49:44,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-30 22:49:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:49:44,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-01-30 22:49:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:49:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 10 proven. 104 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-30 22:49:44,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:49:44,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165901679] [2022-01-30 22:49:44,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165901679] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:49:44,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339161820] [2022-01-30 22:49:44,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-30 22:49:44,848 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:49:44,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:49:44,849 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:49:44,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-01-30 22:49:45,097 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-01-30 22:49:45,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:49:45,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-30 22:49:45,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:50:30,801 INFO L353 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-01-30 22:50:30,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2022-01-30 22:50:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-01-30 22:50:30,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:50:31,035 INFO L353 Elim1Store]: treesize reduction 10, result has 33.3 percent of original size [2022-01-30 22:50:31,035 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-01-30 22:50:31,096 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-01-30 22:50:31,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339161820] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:50:31,097 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:50:31,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 17, 16] total 43 [2022-01-30 22:50:31,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951164179] [2022-01-30 22:50:31,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:50:31,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-01-30 22:50:31,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:50:31,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-01-30 22:50:31,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1651, Unknown=5, NotChecked=0, Total=1806 [2022-01-30 22:50:31,098 INFO L87 Difference]: Start difference. First operand 365 states and 428 transitions. Second operand has 43 states, 41 states have (on average 2.658536585365854) internal successors, (109), 40 states have internal predecessors, (109), 14 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-01-30 22:50:49,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:50:49,922 INFO L93 Difference]: Finished difference Result 1074 states and 1431 transitions. [2022-01-30 22:50:49,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-01-30 22:50:49,922 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 2.658536585365854) internal successors, (109), 40 states have internal predecessors, (109), 14 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) Word has length 89 [2022-01-30 22:50:49,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:50:49,926 INFO L225 Difference]: With dead ends: 1074 [2022-01-30 22:50:49,926 INFO L226 Difference]: Without dead ends: 1072 [2022-01-30 22:50:49,927 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 187 SyntacticMatches, 14 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5470 ImplicationChecksByTransitivity, 63.4s TimeCoverageRelationStatistics Valid=1602, Invalid=14895, Unknown=15, NotChecked=0, Total=16512 [2022-01-30 22:50:49,928 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 1085 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 1910 mSolverCounterSat, 811 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 2901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 811 IncrementalHoareTripleChecker+Valid, 1910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 180 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-30 22:50:49,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1085 Valid, 333 Invalid, 2901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [811 Valid, 1910 Invalid, 0 Unknown, 180 Unchecked, 1.1s Time] [2022-01-30 22:50:49,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2022-01-30 22:50:50,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 234. [2022-01-30 22:50:50,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 203 states have (on average 1.2364532019704433) internal successors, (251), 206 states have internal predecessors, (251), 16 states have call successors, (16), 15 states have call predecessors, (16), 14 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2022-01-30 22:50:50,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 282 transitions. [2022-01-30 22:50:50,032 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 282 transitions. Word has length 89 [2022-01-30 22:50:50,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:50:50,033 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 282 transitions. [2022-01-30 22:50:50,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 2.658536585365854) internal successors, (109), 40 states have internal predecessors, (109), 14 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-01-30 22:50:50,033 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 282 transitions. [2022-01-30 22:50:50,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-30 22:50:50,034 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:50:50,034 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:50:50,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-01-30 22:50:50,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:50:50,251 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:50:50,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:50:50,252 INFO L85 PathProgramCache]: Analyzing trace with hash -83125432, now seen corresponding path program 5 times [2022-01-30 22:50:50,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:50:50,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693436159] [2022-01-30 22:50:50,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:50:50,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:50:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:50:50,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:50:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:50:50,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-30 22:50:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:50:50,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-30 22:50:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:50:50,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-30 22:50:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:50:50,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-30 22:50:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:50:50,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-30 22:50:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:50:50,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-01-30 22:50:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:50:50,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-30 22:50:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:50:50,421 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 63 proven. 57 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-01-30 22:50:50,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:50:50,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693436159] [2022-01-30 22:50:50,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693436159] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:50:50,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628285779] [2022-01-30 22:50:50,422 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-30 22:50:50,422 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:50:50,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:50:50,423 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:50:50,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-01-30 22:50:50,669 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-01-30 22:50:50,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:50:50,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-30 22:50:50,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:50:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 84 proven. 36 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-01-30 22:50:50,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:50:51,101 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 84 proven. 36 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-01-30 22:50:51,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628285779] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:50:51,102 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:50:51,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 27 [2022-01-30 22:50:51,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702269449] [2022-01-30 22:50:51,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:50:51,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-30 22:50:51,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:50:51,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-30 22:50:51,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-01-30 22:50:51,103 INFO L87 Difference]: Start difference. First operand 234 states and 282 transitions. Second operand has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 26 states have internal predecessors, (88), 16 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-01-30 22:50:51,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:50:51,532 INFO L93 Difference]: Finished difference Result 371 states and 452 transitions. [2022-01-30 22:50:51,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-30 22:50:51,532 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 26 states have internal predecessors, (88), 16 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 97 [2022-01-30 22:50:51,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:50:51,533 INFO L225 Difference]: With dead ends: 371 [2022-01-30 22:50:51,533 INFO L226 Difference]: Without dead ends: 265 [2022-01-30 22:50:51,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=1032, Unknown=0, NotChecked=0, Total=1332 [2022-01-30 22:50:51,534 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 286 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-30 22:50:51,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 102 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-30 22:50:51,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-01-30 22:50:51,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 109. [2022-01-30 22:50:51,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 90 states have internal predecessors, (100), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-01-30 22:50:51,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2022-01-30 22:50:51,588 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 97 [2022-01-30 22:50:51,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:50:51,588 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2022-01-30 22:50:51,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 26 states have internal predecessors, (88), 16 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-01-30 22:50:51,588 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2022-01-30 22:50:51,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-30 22:50:51,589 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:50:51,589 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:50:51,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-01-30 22:50:51,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:50:51,805 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:50:51,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:50:51,806 INFO L85 PathProgramCache]: Analyzing trace with hash -669747026, now seen corresponding path program 6 times [2022-01-30 22:50:51,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:50:51,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862183539] [2022-01-30 22:50:51,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:50:51,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:50:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:50:52,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:50:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:50:52,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-30 22:50:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:50:52,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-30 22:50:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:50:52,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-30 22:50:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:50:52,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-01-30 22:50:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:50:52,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-30 22:50:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:50:52,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-01-30 22:50:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:50:52,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-30 22:50:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:50:52,656 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 12 proven. 170 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-01-30 22:50:52,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:50:52,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862183539] [2022-01-30 22:50:52,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862183539] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:50:52,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851069395] [2022-01-30 22:50:52,656 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-30 22:50:52,656 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:50:52,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:50:52,660 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:50:52,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-01-30 22:50:53,294 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-01-30 22:50:53,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:50:53,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 34 conjunts are in the unsatisfiable core [2022-01-30 22:50:53,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:50:53,415 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-01-30 22:50:53,493 INFO L353 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-01-30 22:50:53,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2022-01-30 22:50:53,569 INFO L353 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-01-30 22:50:53,569 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2022-01-30 22:50:55,233 INFO L353 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2022-01-30 22:50:55,234 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 13 [2022-01-30 22:50:55,318 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-01-30 22:50:55,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:50:56,790 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-01-30 22:50:56,792 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2022-01-30 22:50:56,917 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 14 proven. 104 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-01-30 22:50:56,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851069395] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:50:56,917 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:50:56,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 19, 18] total 50 [2022-01-30 22:50:56,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021399523] [2022-01-30 22:50:56,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:50:56,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-01-30 22:50:56,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:50:56,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-01-30 22:50:56,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2241, Unknown=2, NotChecked=0, Total=2450 [2022-01-30 22:50:56,919 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand has 50 states, 48 states have (on average 2.875) internal successors, (138), 47 states have internal predecessors, (138), 17 states have call successors, (21), 5 states have call predecessors, (21), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-01-30 22:55:22,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:55:22,104 INFO L93 Difference]: Finished difference Result 1222 states and 1680 transitions. [2022-01-30 22:55:22,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 354 states. [2022-01-30 22:55:22,107 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.875) internal successors, (138), 47 states have internal predecessors, (138), 17 states have call successors, (21), 5 states have call predecessors, (21), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 106 [2022-01-30 22:55:22,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:55:22,110 INFO L225 Difference]: With dead ends: 1222 [2022-01-30 22:55:22,110 INFO L226 Difference]: Without dead ends: 1220 [2022-01-30 22:55:22,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 737 GetRequests, 333 SyntacticMatches, 21 SemanticMatches, 383 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61050 ImplicationChecksByTransitivity, 264.0s TimeCoverageRelationStatistics Valid=8988, Invalid=138732, Unknown=120, NotChecked=0, Total=147840 [2022-01-30 22:55:22,116 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 4686 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 4456 mSolverCounterSat, 3304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4688 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 9653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3304 IncrementalHoareTripleChecker+Valid, 4456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1893 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-01-30 22:55:22,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4688 Valid, 911 Invalid, 9653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3304 Valid, 4456 Invalid, 0 Unknown, 1893 Unchecked, 3.3s Time] [2022-01-30 22:55:22,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2022-01-30 22:55:22,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 207. [2022-01-30 22:55:22,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 166 states have (on average 1.1144578313253013) internal successors, (185), 168 states have internal predecessors, (185), 24 states have call successors, (24), 18 states have call predecessors, (24), 16 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-01-30 22:55:22,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 232 transitions. [2022-01-30 22:55:22,226 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 232 transitions. Word has length 106 [2022-01-30 22:55:22,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:55:22,226 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 232 transitions. [2022-01-30 22:55:22,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.875) internal successors, (138), 47 states have internal predecessors, (138), 17 states have call successors, (21), 5 states have call predecessors, (21), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-01-30 22:55:22,226 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 232 transitions. [2022-01-30 22:55:22,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-30 22:55:22,227 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:55:22,227 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:55:22,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-01-30 22:55:22,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-01-30 22:55:22,440 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:55:22,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:55:22,440 INFO L85 PathProgramCache]: Analyzing trace with hash -109047248, now seen corresponding path program 4 times [2022-01-30 22:55:22,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:55:22,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895326676] [2022-01-30 22:55:22,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:55:22,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:55:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:55:23,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:55:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:55:23,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-30 22:55:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:55:23,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-30 22:55:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:55:23,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-30 22:55:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:55:23,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-01-30 22:55:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:55:23,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-30 22:55:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:55:23,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-01-30 22:55:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:55:23,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-30 22:55:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:55:23,936 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 12 proven. 170 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-01-30 22:55:23,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:55:23,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895326676] [2022-01-30 22:55:23,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895326676] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:55:23,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678020788] [2022-01-30 22:55:23,937 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-30 22:55:23,937 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:55:23,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:55:23,938 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:55:23,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-01-30 22:55:24,042 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-30 22:55:24,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:55:24,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 30 conjunts are in the unsatisfiable core [2022-01-30 22:55:24,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:55:24,243 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-01-30 22:55:24,243 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22