/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/array-cav19/array_init_nondet_vars.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 10:35:08,004 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 10:35:08,006 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 10:35:08,059 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 10:35:08,060 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 10:35:08,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 10:35:08,061 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 10:35:08,063 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 10:35:08,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 10:35:08,064 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 10:35:08,065 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 10:35:08,066 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 10:35:08,066 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 10:35:08,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 10:35:08,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 10:35:08,068 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 10:35:08,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 10:35:08,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 10:35:08,087 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 10:35:08,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 10:35:08,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 10:35:08,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 10:35:08,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 10:35:08,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 10:35:08,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 10:35:08,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 10:35:08,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 10:35:08,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 10:35:08,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 10:35:08,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 10:35:08,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 10:35:08,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 10:35:08,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 10:35:08,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 10:35:08,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 10:35:08,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 10:35:08,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 10:35:08,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 10:35:08,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 10:35:08,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 10:35:08,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 10:35:08,107 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 10:35:08,113 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 10:35:08,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 10:35:08,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 10:35:08,114 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 10:35:08,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 10:35:08,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 10:35:08,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 10:35:08,114 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 10:35:08,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 10:35:08,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 10:35:08,115 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 10:35:08,115 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 10:35:08,115 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 10:35:08,115 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 10:35:08,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 10:35:08,116 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 10:35:08,116 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 10:35:08,116 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 10:35:08,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 10:35:08,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 10:35:08,116 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 10:35:08,117 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 10:35:08,117 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-31 10:35:08,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 10:35:08,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 10:35:08,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 10:35:08,331 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 10:35:08,331 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 10:35:08,332 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-cav19/array_init_nondet_vars.c [2022-01-31 10:35:08,373 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0065ba1c/9574c12091aa474ab7b3e43e0521ca98/FLAGe96e97072 [2022-01-31 10:35:08,713 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 10:35:08,714 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-cav19/array_init_nondet_vars.c [2022-01-31 10:35:08,749 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0065ba1c/9574c12091aa474ab7b3e43e0521ca98/FLAGe96e97072 [2022-01-31 10:35:09,152 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0065ba1c/9574c12091aa474ab7b3e43e0521ca98 [2022-01-31 10:35:09,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 10:35:09,155 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 10:35:09,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 10:35:09,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 10:35:09,160 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 10:35:09,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 10:35:09" (1/1) ... [2022-01-31 10:35:09,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63e7aa33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:35:09, skipping insertion in model container [2022-01-31 10:35:09,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 10:35:09" (1/1) ... [2022-01-31 10:35:09,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 10:35:09,174 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 10:35:09,261 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-cav19/array_init_nondet_vars.c[413,426] [2022-01-31 10:35:09,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 10:35:09,297 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 10:35:09,306 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-cav19/array_init_nondet_vars.c[413,426] [2022-01-31 10:35:09,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 10:35:09,329 INFO L208 MainTranslator]: Completed translation [2022-01-31 10:35:09,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:35:09 WrapperNode [2022-01-31 10:35:09,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 10:35:09,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 10:35:09,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 10:35:09,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 10:35:09,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:35:09" (1/1) ... [2022-01-31 10:35:09,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:35:09" (1/1) ... [2022-01-31 10:35:09,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:35:09" (1/1) ... [2022-01-31 10:35:09,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:35:09" (1/1) ... [2022-01-31 10:35:09,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:35:09" (1/1) ... [2022-01-31 10:35:09,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:35:09" (1/1) ... [2022-01-31 10:35:09,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:35:09" (1/1) ... [2022-01-31 10:35:09,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 10:35:09,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 10:35:09,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 10:35:09,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 10:35:09,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:35:09" (1/1) ... [2022-01-31 10:35:09,364 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 10:35:09,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:35:09,384 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-31 10:35:09,385 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-31 10:35:09,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 10:35:09,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 10:35:09,409 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 10:35:09,409 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 10:35:09,409 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 10:35:09,409 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 10:35:09,409 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 10:35:09,409 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 10:35:09,410 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 10:35:09,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 10:35:09,410 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 10:35:09,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 10:35:09,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 10:35:09,410 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 10:35:09,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 10:35:09,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 10:35:09,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 10:35:09,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 10:35:09,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 10:35:09,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 10:35:09,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 10:35:09,452 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 10:35:09,453 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 10:35:09,546 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 10:35:09,551 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 10:35:09,551 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-31 10:35:09,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 10:35:09 BoogieIcfgContainer [2022-01-31 10:35:09,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 10:35:09,553 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 10:35:09,553 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 10:35:09,554 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 10:35:09,556 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 10:35:09" (1/1) ... [2022-01-31 10:35:09,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 10:35:09 BasicIcfg [2022-01-31 10:35:09,575 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 10:35:09,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 10:35:09,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 10:35:09,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 10:35:09,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 10:35:09" (1/4) ... [2022-01-31 10:35:09,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339a326b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 10:35:09, skipping insertion in model container [2022-01-31 10:35:09,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:35:09" (2/4) ... [2022-01-31 10:35:09,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339a326b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 10:35:09, skipping insertion in model container [2022-01-31 10:35:09,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 10:35:09" (3/4) ... [2022-01-31 10:35:09,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339a326b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 10:35:09, skipping insertion in model container [2022-01-31 10:35:09,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 10:35:09" (4/4) ... [2022-01-31 10:35:09,592 INFO L111 eAbstractionObserver]: Analyzing ICFG array_init_nondet_vars.cJordan [2022-01-31 10:35:09,595 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 10:35:09,595 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 10:35:09,623 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 10:35:09,632 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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-31 10:35:09,632 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 10:35:09,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 10:35:09,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-31 10:35:09,649 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:35:09,649 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:35:09,649 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:35:09,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:35:09,652 INFO L85 PathProgramCache]: Analyzing trace with hash -2113452785, now seen corresponding path program 1 times [2022-01-31 10:35:09,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:35:09,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398122152] [2022-01-31 10:35:09,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:35:09,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:35:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:09,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:35:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:09,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:35:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:09,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:35:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:09,826 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-31 10:35:09,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:35:09,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398122152] [2022-01-31 10:35:09,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398122152] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 10:35:09,827 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 10:35:09,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 10:35:09,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400870771] [2022-01-31 10:35:09,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 10:35:09,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 10:35:09,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:35:09,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 10:35:09,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 10:35:09,856 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 10:35:09,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:35:09,901 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-01-31 10:35:09,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 10:35:09,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-01-31 10:35:09,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:35:09,908 INFO L225 Difference]: With dead ends: 34 [2022-01-31 10:35:09,908 INFO L226 Difference]: Without dead ends: 29 [2022-01-31 10:35:09,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 10:35:09,915 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 10:35:09,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 36 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 10:35:09,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-31 10:35:09,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-01-31 10:35:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 10:35:09,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-01-31 10:35:09,938 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 25 [2022-01-31 10:35:09,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:35:09,939 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-01-31 10:35:09,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 10:35:09,940 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-01-31 10:35:09,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-31 10:35:09,942 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:35:09,942 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:35:09,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 10:35:09,942 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:35:09,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:35:09,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1669590766, now seen corresponding path program 1 times [2022-01-31 10:35:09,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:35:09,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929605347] [2022-01-31 10:35:09,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:35:09,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:35:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:10,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:35:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:10,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:35:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:10,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:35:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:10,045 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-31 10:35:10,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:35:10,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929605347] [2022-01-31 10:35:10,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929605347] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 10:35:10,046 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 10:35:10,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 10:35:10,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345006647] [2022-01-31 10:35:10,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 10:35:10,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 10:35:10,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:35:10,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 10:35:10,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-31 10:35:10,047 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 10:35:10,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:35:10,151 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-01-31 10:35:10,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 10:35:10,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-01-31 10:35:10,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:35:10,153 INFO L225 Difference]: With dead ends: 39 [2022-01-31 10:35:10,153 INFO L226 Difference]: Without dead ends: 37 [2022-01-31 10:35:10,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 10:35:10,157 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 10:35:10,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 34 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 10:35:10,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-31 10:35:10,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-01-31 10:35:10,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 10:35:10,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-01-31 10:35:10,162 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2022-01-31 10:35:10,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:35:10,164 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-01-31 10:35:10,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 10:35:10,165 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-01-31 10:35:10,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 10:35:10,166 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:35:10,166 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:35:10,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 10:35:10,166 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:35:10,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:35:10,167 INFO L85 PathProgramCache]: Analyzing trace with hash 488681968, now seen corresponding path program 1 times [2022-01-31 10:35:10,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:35:10,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219196051] [2022-01-31 10:35:10,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:35:10,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:35:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:10,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:35:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:10,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:35:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:10,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:35:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:10,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:35:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:10,437 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-31 10:35:10,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:35:10,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219196051] [2022-01-31 10:35:10,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219196051] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:35:10,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690002198] [2022-01-31 10:35:10,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:35:10,438 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:35:10,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:35:10,444 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-31 10:35:10,466 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-31 10:35:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:10,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-31 10:35:10,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:35:10,700 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 13 treesize of output 9 [2022-01-31 10:35:10,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 25 treesize of output 9 [2022-01-31 10:35:10,780 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-31 10:35:10,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:35:10,842 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 16 treesize of output 14 [2022-01-31 10:35:10,845 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-01-31 10:35:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-31 10:35:10,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690002198] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:35:10,995 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:35:10,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 21 [2022-01-31 10:35:10,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639607378] [2022-01-31 10:35:10,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:35:10,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 10:35:10,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:35:10,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 10:35:10,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2022-01-31 10:35:10,997 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 21 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-01-31 10:35:11,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:35:11,435 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-01-31 10:35:11,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 10:35:11,436 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 33 [2022-01-31 10:35:11,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:35:11,436 INFO L225 Difference]: With dead ends: 53 [2022-01-31 10:35:11,436 INFO L226 Difference]: Without dead ends: 53 [2022-01-31 10:35:11,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=893, Unknown=0, NotChecked=0, Total=1056 [2022-01-31 10:35:11,437 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 80 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 10:35:11,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 96 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 10:35:11,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-31 10:35:11,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2022-01-31 10:35:11,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-31 10:35:11,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-01-31 10:35:11,442 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 33 [2022-01-31 10:35:11,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:35:11,442 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-01-31 10:35:11,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-01-31 10:35:11,443 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-01-31 10:35:11,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 10:35:11,443 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:35:11,443 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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-31 10:35:11,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-31 10:35:11,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:35:11,675 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:35:11,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:35:11,676 INFO L85 PathProgramCache]: Analyzing trace with hash 2118488834, now seen corresponding path program 1 times [2022-01-31 10:35:11,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:35:11,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321480509] [2022-01-31 10:35:11,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:35:11,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:35:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:11,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:35:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:11,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:35:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:11,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:35:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:11,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:35:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:11,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 10:35:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 10:35:11,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:35:11,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321480509] [2022-01-31 10:35:11,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321480509] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:35:11,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578216599] [2022-01-31 10:35:11,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:35:11,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:35:11,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:35:11,806 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-31 10:35:11,807 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-31 10:35:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:11,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 10:35:11,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:35:11,930 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 10:35:11,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:35:12,006 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 10:35:12,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578216599] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:35:12,007 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:35:12,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 10:35:12,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066941601] [2022-01-31 10:35:12,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:35:12,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 10:35:12,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:35:12,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 10:35:12,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 10:35:12,008 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 7 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-01-31 10:35:12,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:35:12,153 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2022-01-31 10:35:12,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 10:35:12,153 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 7 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 41 [2022-01-31 10:35:12,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:35:12,154 INFO L225 Difference]: With dead ends: 55 [2022-01-31 10:35:12,154 INFO L226 Difference]: Without dead ends: 45 [2022-01-31 10:35:12,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-01-31 10:35:12,155 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 49 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 10:35:12,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 44 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 10:35:12,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-31 10:35:12,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2022-01-31 10:35:12,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 10:35:12,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-01-31 10:35:12,159 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 41 [2022-01-31 10:35:12,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:35:12,159 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-01-31 10:35:12,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 7 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-01-31 10:35:12,160 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-01-31 10:35:12,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 10:35:12,160 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:35:12,160 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 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-31 10:35:12,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-31 10:35:12,367 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-31 10:35:12,368 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:35:12,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:35:12,368 INFO L85 PathProgramCache]: Analyzing trace with hash 310219982, now seen corresponding path program 2 times [2022-01-31 10:35:12,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:35:12,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323930552] [2022-01-31 10:35:12,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:35:12,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:35:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:12,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:35:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:12,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:35:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:12,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:35:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:12,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:35:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:12,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:35:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:12,576 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 10:35:12,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:35:12,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323930552] [2022-01-31 10:35:12,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323930552] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:35:12,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052961825] [2022-01-31 10:35:12,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 10:35:12,577 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:35:12,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:35:12,578 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-31 10:35:12,579 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-31 10:35:12,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 10:35:12,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:35:12,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-31 10:35:12,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:35:12,735 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:35:12,825 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:35:12,825 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:35:12,844 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 9 [2022-01-31 10:35:12,878 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-31 10:35:12,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:35:12,982 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 21 treesize of output 19 [2022-01-31 10:35:12,984 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 37 treesize of output 33 [2022-01-31 10:35:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 10:35:13,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052961825] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:35:13,126 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:35:13,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 25 [2022-01-31 10:35:13,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814000613] [2022-01-31 10:35:13,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:35:13,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 10:35:13,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:35:13,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 10:35:13,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2022-01-31 10:35:13,130 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 25 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 18 states have internal predecessors, (41), 7 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2022-01-31 10:35:13,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:35:13,467 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-01-31 10:35:13,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 10:35:13,467 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 18 states have internal predecessors, (41), 7 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) Word has length 41 [2022-01-31 10:35:13,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:35:13,471 INFO L225 Difference]: With dead ends: 47 [2022-01-31 10:35:13,471 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 10:35:13,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 74 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=214, Invalid=1426, Unknown=0, NotChecked=0, Total=1640 [2022-01-31 10:35:13,476 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 60 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 10:35:13,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 73 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 339 Invalid, 0 Unknown, 53 Unchecked, 0.1s Time] [2022-01-31 10:35:13,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 10:35:13,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2022-01-31 10:35:13,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-31 10:35:13,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-01-31 10:35:13,489 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 41 [2022-01-31 10:35:13,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:35:13,490 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-01-31 10:35:13,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 18 states have internal predecessors, (41), 7 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2022-01-31 10:35:13,490 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-01-31 10:35:13,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 10:35:13,490 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:35:13,490 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 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-31 10:35:13,511 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-31 10:35:13,708 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-31 10:35:13,708 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:35:13,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:35:13,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1425586144, now seen corresponding path program 2 times [2022-01-31 10:35:13,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:35:13,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232728409] [2022-01-31 10:35:13,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:35:13,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:35:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:13,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:35:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:13,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:35:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:13,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:35:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:13,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:35:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:13,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:35:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:13,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-31 10:35:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:13,895 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 10:35:13,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:35:13,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232728409] [2022-01-31 10:35:13,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232728409] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:35:13,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248759734] [2022-01-31 10:35:13,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 10:35:13,896 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:35:13,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:35:13,897 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-31 10:35:13,898 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-31 10:35:13,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 10:35:13,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:35:13,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-31 10:35:13,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:35:14,071 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:35:16,065 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (< (+ v_main_~i~0_30 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| (* v_main_~i~0_30 4)))))) is different from true [2022-01-31 10:35:21,622 INFO L353 Elim1Store]: treesize reduction 33, result has 42.1 percent of original size [2022-01-31 10:35:21,622 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 38 treesize of output 37 [2022-01-31 10:35:21,699 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 2 not checked. [2022-01-31 10:35:21,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:35:21,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248759734] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:35:21,794 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 10:35:21,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 30 [2022-01-31 10:35:21,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418913621] [2022-01-31 10:35:21,794 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 10:35:21,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-31 10:35:21,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:35:21,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-31 10:35:21,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=836, Unknown=2, NotChecked=58, Total=992 [2022-01-31 10:35:21,795 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 30 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 23 states have internal predecessors, (48), 9 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2022-01-31 10:35:40,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:35:40,563 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-01-31 10:35:40,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-31 10:35:40,563 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 23 states have internal predecessors, (48), 9 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) Word has length 49 [2022-01-31 10:35:40,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:35:40,564 INFO L225 Difference]: With dead ends: 66 [2022-01-31 10:35:40,564 INFO L226 Difference]: Without dead ends: 48 [2022-01-31 10:35:40,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=259, Invalid=2188, Unknown=7, NotChecked=96, Total=2550 [2022-01-31 10:35:40,565 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 38 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 10:35:40,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 151 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 313 Invalid, 0 Unknown, 160 Unchecked, 0.2s Time] [2022-01-31 10:35:40,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-31 10:35:40,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-01-31 10:35:40,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-31 10:35:40,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-01-31 10:35:40,568 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 49 [2022-01-31 10:35:40,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:35:40,569 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-01-31 10:35:40,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 23 states have internal predecessors, (48), 9 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2022-01-31 10:35:40,569 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-01-31 10:35:40,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-31 10:35:40,569 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:35:40,569 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 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-31 10:35:40,588 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-31 10:35:40,770 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-31 10:35:40,770 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:35:40,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:35:40,770 INFO L85 PathProgramCache]: Analyzing trace with hash -73392450, now seen corresponding path program 3 times [2022-01-31 10:35:40,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:35:40,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247607326] [2022-01-31 10:35:40,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:35:40,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:35:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:40,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:35:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:40,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:35:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:40,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:35:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:40,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:35:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:40,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:35:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:40,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:35:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:40,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-31 10:35:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:40,989 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 10:35:40,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:35:40,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247607326] [2022-01-31 10:35:40,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247607326] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:35:40,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642392939] [2022-01-31 10:35:40,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 10:35:40,990 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:35:40,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:35:41,004 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-31 10:35:41,005 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-31 10:35:41,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 10:35:41,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:35:41,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 28 conjunts are in the unsatisfiable core [2022-01-31 10:35:41,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:35:41,215 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:35:41,423 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-31 10:35:41,423 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 27 treesize of output 26 [2022-01-31 10:35:41,543 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:35:41,610 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 19 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 10:35:41,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:35:41,746 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 21 treesize of output 19 [2022-01-31 10:35:41,749 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 37 treesize of output 33 [2022-01-31 10:35:41,939 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 10:35:41,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642392939] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:35:41,939 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:35:41,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 29 [2022-01-31 10:35:41,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971240794] [2022-01-31 10:35:41,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:35:41,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-31 10:35:41,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:35:41,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-31 10:35:41,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2022-01-31 10:35:41,941 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 29 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 22 states have internal predecessors, (60), 11 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-01-31 10:35:42,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:35:42,416 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2022-01-31 10:35:42,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-31 10:35:42,416 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 22 states have internal predecessors, (60), 11 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) Word has length 57 [2022-01-31 10:35:42,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:35:42,417 INFO L225 Difference]: With dead ends: 78 [2022-01-31 10:35:42,417 INFO L226 Difference]: Without dead ends: 78 [2022-01-31 10:35:42,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 106 SyntacticMatches, 12 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=245, Invalid=1917, Unknown=0, NotChecked=0, Total=2162 [2022-01-31 10:35:42,418 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 78 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 10:35:42,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 128 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 499 Invalid, 0 Unknown, 93 Unchecked, 0.2s Time] [2022-01-31 10:35:42,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-01-31 10:35:42,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2022-01-31 10:35:42,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.065217391304348) internal successors, (49), 47 states have internal predecessors, (49), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-31 10:35:42,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-01-31 10:35:42,422 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 57 [2022-01-31 10:35:42,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:35:42,423 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-01-31 10:35:42,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 22 states have internal predecessors, (60), 11 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-01-31 10:35:42,423 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-01-31 10:35:42,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-31 10:35:42,423 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:35:42,423 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:35:42,440 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-31 10:35:42,639 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-31 10:35:42,640 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:35:42,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:35:42,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1683336752, now seen corresponding path program 4 times [2022-01-31 10:35:42,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:35:42,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148542319] [2022-01-31 10:35:42,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:35:42,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:35:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:42,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:35:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:42,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:35:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:42,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:35:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:42,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:35:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:42,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:35:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:42,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:35:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:42,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-31 10:35:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:42,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-31 10:35:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:42,920 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 16 proven. 29 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-31 10:35:42,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:35:42,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148542319] [2022-01-31 10:35:42,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148542319] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:35:42,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363363241] [2022-01-31 10:35:42,920 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 10:35:42,920 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:35:42,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:35:42,921 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-31 10:35:42,922 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-31 10:35:42,966 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 10:35:42,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:35:42,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-31 10:35:42,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:35:43,144 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 13 treesize of output 9 [2022-01-31 10:35:43,387 INFO L353 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-01-31 10:35:43,387 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-31 10:35:43,438 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-31 10:35:43,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:35:43,556 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 16 treesize of output 14 [2022-01-31 10:35:43,559 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-01-31 10:35:43,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363363241] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:35:43,663 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 10:35:43,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 31 [2022-01-31 10:35:43,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432122121] [2022-01-31 10:35:43,664 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 10:35:43,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-31 10:35:43,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:35:43,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-31 10:35:43,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1139, Unknown=0, NotChecked=0, Total=1260 [2022-01-31 10:35:43,665 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 31 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 24 states have internal predecessors, (61), 14 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (14), 13 states have call predecessors, (14), 12 states have call successors, (14) [2022-01-31 10:35:44,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:35:44,407 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2022-01-31 10:35:44,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-31 10:35:44,407 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 24 states have internal predecessors, (61), 14 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (14), 13 states have call predecessors, (14), 12 states have call successors, (14) Word has length 65 [2022-01-31 10:35:44,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:35:44,408 INFO L225 Difference]: With dead ends: 97 [2022-01-31 10:35:44,408 INFO L226 Difference]: Without dead ends: 97 [2022-01-31 10:35:44,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 85 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=334, Invalid=2746, Unknown=0, NotChecked=0, Total=3080 [2022-01-31 10:35:44,410 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 165 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 10:35:44,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 134 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 943 Invalid, 0 Unknown, 96 Unchecked, 0.4s Time] [2022-01-31 10:35:44,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-01-31 10:35:44,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 73. [2022-01-31 10:35:44,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 53 states have internal predecessors, (55), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-01-31 10:35:44,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-01-31 10:35:44,414 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 65 [2022-01-31 10:35:44,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:35:44,415 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-01-31 10:35:44,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 24 states have internal predecessors, (61), 14 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (14), 13 states have call predecessors, (14), 12 states have call successors, (14) [2022-01-31 10:35:44,415 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-01-31 10:35:44,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-31 10:35:44,415 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:35:44,415 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 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-31 10:35:44,433 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-31 10:35:44,627 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-31 10:35:44,628 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:35:44,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:35:44,628 INFO L85 PathProgramCache]: Analyzing trace with hash -489044068, now seen corresponding path program 5 times [2022-01-31 10:35:44,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:35:44,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382116255] [2022-01-31 10:35:44,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:35:44,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:35:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:44,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:35:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:44,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:35:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:44,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:35:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:44,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:35:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:44,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:35:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:44,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:35:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:44,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:35:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:44,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-31 10:35:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:44,857 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 11 proven. 45 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-01-31 10:35:44,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:35:44,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382116255] [2022-01-31 10:35:44,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382116255] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:35:44,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482967421] [2022-01-31 10:35:44,857 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 10:35:44,857 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:35:44,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:35:44,858 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-31 10:35:44,859 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-31 10:35:44,902 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-01-31 10:35:44,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:35:44,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-31 10:35:44,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:35:45,029 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:35:45,085 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:35:45,086 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:35:45,153 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:35:45,153 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:35:45,212 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:35:45,272 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 32 proven. 44 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 10:35:45,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:35:45,432 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 21 treesize of output 19 [2022-01-31 10:35:45,434 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 37 treesize of output 33 [2022-01-31 10:35:45,591 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 11 proven. 44 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-01-31 10:35:45,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482967421] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:35:45,591 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:35:45,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 30 [2022-01-31 10:35:45,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567390001] [2022-01-31 10:35:45,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:35:45,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-31 10:35:45,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:35:45,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-31 10:35:45,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=772, Unknown=0, NotChecked=0, Total=870 [2022-01-31 10:35:45,593 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 30 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 23 states have internal predecessors, (65), 12 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (15), 12 states have call predecessors, (15), 10 states have call successors, (15) [2022-01-31 10:35:46,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:35:46,159 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2022-01-31 10:35:46,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-31 10:35:46,159 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 23 states have internal predecessors, (65), 12 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (15), 12 states have call predecessors, (15), 10 states have call successors, (15) Word has length 65 [2022-01-31 10:35:46,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:35:46,160 INFO L225 Difference]: With dead ends: 97 [2022-01-31 10:35:46,160 INFO L226 Difference]: Without dead ends: 97 [2022-01-31 10:35:46,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 122 SyntacticMatches, 15 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=265, Invalid=2087, Unknown=0, NotChecked=0, Total=2352 [2022-01-31 10:35:46,161 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 78 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 10:35:46,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 124 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 799 Invalid, 0 Unknown, 108 Unchecked, 0.3s Time] [2022-01-31 10:35:46,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-01-31 10:35:46,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 77. [2022-01-31 10:35:46,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 56 states have internal predecessors, (58), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-01-31 10:35:46,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2022-01-31 10:35:46,166 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 65 [2022-01-31 10:35:46,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:35:46,166 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2022-01-31 10:35:46,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 23 states have internal predecessors, (65), 12 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (15), 12 states have call predecessors, (15), 10 states have call successors, (15) [2022-01-31 10:35:46,166 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-01-31 10:35:46,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-31 10:35:46,167 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:35:46,167 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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] [2022-01-31 10:35:46,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-31 10:35:46,379 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-31 10:35:46,379 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:35:46,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:35:46,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1600040222, now seen corresponding path program 6 times [2022-01-31 10:35:46,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:35:46,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049096397] [2022-01-31 10:35:46,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:35:46,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:35:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:46,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:35:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:46,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:35:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:46,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:35:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:46,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:35:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:46,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:35:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:46,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:35:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:46,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-31 10:35:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:46,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-31 10:35:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:46,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-31 10:35:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:46,459 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-01-31 10:35:46,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:35:46,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049096397] [2022-01-31 10:35:46,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049096397] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:35:46,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84677085] [2022-01-31 10:35:46,460 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 10:35:46,460 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:35:46,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:35:46,461 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-31 10:35:46,463 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-31 10:35:46,500 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-01-31 10:35:46,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:35:46,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 10:35:46,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:35:46,650 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-01-31 10:35:46,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:35:46,759 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-01-31 10:35:46,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84677085] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:35:46,760 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:35:46,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 10:35:46,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281283379] [2022-01-31 10:35:46,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:35:46,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 10:35:46,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:35:46,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 10:35:46,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 10:35:46,761 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 13 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-01-31 10:35:46,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:35:46,962 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2022-01-31 10:35:46,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 10:35:46,962 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 13 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) Word has length 73 [2022-01-31 10:35:46,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:35:46,963 INFO L225 Difference]: With dead ends: 99 [2022-01-31 10:35:46,963 INFO L226 Difference]: Without dead ends: 81 [2022-01-31 10:35:46,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=572, Unknown=0, NotChecked=0, Total=756 [2022-01-31 10:35:46,964 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 77 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 10:35:46,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 53 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 10:35:46,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-01-31 10:35:46,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 68. [2022-01-31 10:35:46,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 49 states have internal predecessors, (50), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-31 10:35:46,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-01-31 10:35:46,969 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 73 [2022-01-31 10:35:46,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:35:46,969 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-01-31 10:35:46,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 13 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-01-31 10:35:46,969 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-01-31 10:35:46,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-31 10:35:46,970 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:35:46,970 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 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] [2022-01-31 10:35:46,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-01-31 10:35:47,179 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-31 10:35:47,179 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:35:47,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:35:47,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1240187730, now seen corresponding path program 7 times [2022-01-31 10:35:47,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:35:47,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658854640] [2022-01-31 10:35:47,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:35:47,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:35:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:47,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:35:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:47,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:35:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:47,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:35:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:47,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:35:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:47,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:35:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:47,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:35:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:47,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:35:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:47,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-31 10:35:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:47,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-31 10:35:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:47,471 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 16 proven. 48 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-31 10:35:47,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:35:47,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658854640] [2022-01-31 10:35:47,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658854640] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:35:47,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285545375] [2022-01-31 10:35:47,471 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 10:35:47,471 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:35:47,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:35:47,472 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-31 10:35:47,473 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-31 10:35:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:47,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-31 10:35:47,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:35:47,688 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:35:47,771 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:35:47,772 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:35:47,944 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 9 [2022-01-31 10:35:47,985 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 26 proven. 52 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-31 10:35:47,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:35:48,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285545375] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:35:48,169 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 10:35:48,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 34 [2022-01-31 10:35:48,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787412703] [2022-01-31 10:35:48,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 10:35:48,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-31 10:35:48,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:35:48,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-31 10:35:48,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1267, Unknown=0, NotChecked=0, Total=1406 [2022-01-31 10:35:48,171 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 34 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 27 states have internal predecessors, (70), 16 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (16), 15 states have call predecessors, (16), 14 states have call successors, (16) [2022-01-31 10:35:48,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:35:48,849 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-01-31 10:35:48,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 10:35:48,850 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 27 states have internal predecessors, (70), 16 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (16), 15 states have call predecessors, (16), 14 states have call successors, (16) Word has length 73 [2022-01-31 10:35:48,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:35:48,850 INFO L225 Difference]: With dead ends: 79 [2022-01-31 10:35:48,850 INFO L226 Difference]: Without dead ends: 79 [2022-01-31 10:35:48,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 92 SyntacticMatches, 8 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1139 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=361, Invalid=3179, Unknown=0, NotChecked=0, Total=3540 [2022-01-31 10:35:48,852 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 78 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 10:35:48,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 151 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 898 Invalid, 0 Unknown, 101 Unchecked, 0.3s Time] [2022-01-31 10:35:48,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-01-31 10:35:48,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2022-01-31 10:35:48,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 55 states have internal predecessors, (56), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-01-31 10:35:48,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-01-31 10:35:48,855 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 73 [2022-01-31 10:35:48,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:35:48,855 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-01-31 10:35:48,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 27 states have internal predecessors, (70), 16 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (16), 15 states have call predecessors, (16), 14 states have call successors, (16) [2022-01-31 10:35:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-01-31 10:35:48,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-31 10:35:48,856 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:35:48,856 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 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] [2022-01-31 10:35:48,873 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-31 10:35:49,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-31 10:35:49,068 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:35:49,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:35:49,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1658421184, now seen corresponding path program 8 times [2022-01-31 10:35:49,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:35:49,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157158305] [2022-01-31 10:35:49,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:35:49,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:35:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:49,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:35:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:49,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:35:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:49,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:35:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:49,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:35:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:49,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:35:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:49,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:35:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:49,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:35:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:49,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-31 10:35:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:49,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-31 10:35:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:49,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 10:35:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:35:49,270 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 21 proven. 55 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-01-31 10:35:49,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:35:49,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157158305] [2022-01-31 10:35:49,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157158305] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:35:49,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197525452] [2022-01-31 10:35:49,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 10:35:49,270 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:35:49,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:35:49,284 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-31 10:35:49,285 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-31 10:35:49,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 10:35:49,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:35:49,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 28 conjunts are in the unsatisfiable core [2022-01-31 10:35:49,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:35:49,592 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:35:51,074 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.offset_BEFORE_CALL_23| Int) (v_main_~i~0_88 Int) (|v_main_~#a~0.base_BEFORE_CALL_23| Int)) (and (< (+ v_main_~i~0_88 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_23|) (+ (* v_main_~i~0_88 4) |v_main_~#a~0.offset_BEFORE_CALL_23|))) (<= v_main_~i~0_88 4))) is different from true [2022-01-31 10:35:59,034 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_24| Int) (v_main_~i~0_88 Int) (|v_main_~#a~0.base_BEFORE_CALL_24| Int)) (and (<= v_main_~i~0_88 4) (< (+ v_main_~i~0_88 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_24|) (+ (* v_main_~i~0_88 4) |v_main_~#a~0.offset_BEFORE_CALL_24|))))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_23| Int) (v_main_~i~0_90 Int) (|v_main_~#a~0.base_BEFORE_CALL_23| Int)) (and (< (+ v_main_~i~0_90 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_23|) (+ |v_main_~#a~0.offset_BEFORE_CALL_23| (* v_main_~i~0_90 4)))) (<= v_main_~i~0_90 4)))) is different from true [2022-01-31 10:36:10,693 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_25| Int) (|v_main_~#a~0.base_BEFORE_CALL_25| Int) (v_main_~i~0_88 Int)) (and (<= v_main_~i~0_88 4) (< (+ v_main_~i~0_88 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_25|) (+ (* v_main_~i~0_88 4) |v_main_~#a~0.offset_BEFORE_CALL_25|))))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_23| Int) (v_main_~i~0_90 Int) (|v_main_~#a~0.base_BEFORE_CALL_23| Int)) (and (< (+ v_main_~i~0_90 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_23|) (+ |v_main_~#a~0.offset_BEFORE_CALL_23| (* v_main_~i~0_90 4)))) (<= v_main_~i~0_90 4)))) is different from true [2022-01-31 10:36:16,029 INFO L353 Elim1Store]: treesize reduction 33, result has 42.1 percent of original size [2022-01-31 10:36:16,030 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 38 treesize of output 37 [2022-01-31 10:36:16,115 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 30 proven. 40 refuted. 0 times theorem prover too weak. 36 trivial. 18 not checked. [2022-01-31 10:36:16,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:36:16,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197525452] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:36:16,257 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 10:36:16,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 41 [2022-01-31 10:36:16,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371232747] [2022-01-31 10:36:16,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 10:36:16,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-31 10:36:16,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:36:16,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-31 10:36:16,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1424, Unknown=5, NotChecked=234, Total=1806 [2022-01-31 10:36:16,261 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 41 states, 39 states have (on average 2.0) internal successors, (78), 34 states have internal predecessors, (78), 17 states have call successors, (21), 7 states have call predecessors, (21), 5 states have return successors, (18), 17 states have call predecessors, (18), 15 states have call successors, (18) [2022-01-31 10:36:31,031 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_24| Int) (v_main_~i~0_88 Int) (|v_main_~#a~0.base_BEFORE_CALL_24| Int)) (and (<= v_main_~i~0_88 4) (< (+ v_main_~i~0_88 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_24|) (+ (* v_main_~i~0_88 4) |v_main_~#a~0.offset_BEFORE_CALL_24|))))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_23| Int) (v_main_~i~0_88 Int) (|v_main_~#a~0.base_BEFORE_CALL_23| Int)) (and (< (+ v_main_~i~0_88 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_23|) (+ (* v_main_~i~0_88 4) |v_main_~#a~0.offset_BEFORE_CALL_23|))) (<= v_main_~i~0_88 4))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_23| Int) (v_main_~i~0_90 Int) (|v_main_~#a~0.base_BEFORE_CALL_23| Int)) (and (< (+ v_main_~i~0_90 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_23|) (+ |v_main_~#a~0.offset_BEFORE_CALL_23| (* v_main_~i~0_90 4)))) (<= v_main_~i~0_90 4)))) is different from true [2022-01-31 10:36:39,158 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_24| Int) (v_main_~i~0_88 Int) (|v_main_~#a~0.base_BEFORE_CALL_24| Int)) (and (<= v_main_~i~0_88 4) (< (+ v_main_~i~0_88 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_24|) (+ (* v_main_~i~0_88 4) |v_main_~#a~0.offset_BEFORE_CALL_24|))))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_25| Int) (|v_main_~#a~0.base_BEFORE_CALL_25| Int) (v_main_~i~0_88 Int)) (and (<= v_main_~i~0_88 4) (< (+ v_main_~i~0_88 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_25|) (+ (* v_main_~i~0_88 4) |v_main_~#a~0.offset_BEFORE_CALL_25|))))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_23| Int) (v_main_~i~0_88 Int) (|v_main_~#a~0.base_BEFORE_CALL_23| Int)) (and (< (+ v_main_~i~0_88 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_23|) (+ (* v_main_~i~0_88 4) |v_main_~#a~0.offset_BEFORE_CALL_23|))) (<= v_main_~i~0_88 4))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_23| Int) (v_main_~i~0_90 Int) (|v_main_~#a~0.base_BEFORE_CALL_23| Int)) (and (< (+ v_main_~i~0_90 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_23|) (+ |v_main_~#a~0.offset_BEFORE_CALL_23| (* v_main_~i~0_90 4)))) (<= v_main_~i~0_90 4)))) is different from true [2022-01-31 10:36:57,630 WARN L228 SmtUtils]: Spent 7.22s on a formula simplification. DAG size of input: 43 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 10:36:57,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:36:57,686 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2022-01-31 10:36:57,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-31 10:36:57,686 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 2.0) internal successors, (78), 34 states have internal predecessors, (78), 17 states have call successors, (21), 7 states have call predecessors, (21), 5 states have return successors, (18), 17 states have call predecessors, (18), 15 states have call successors, (18) Word has length 81 [2022-01-31 10:36:57,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:36:57,687 INFO L225 Difference]: With dead ends: 115 [2022-01-31 10:36:57,687 INFO L226 Difference]: Without dead ends: 81 [2022-01-31 10:36:57,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 67.4s TimeCoverageRelationStatistics Valid=443, Invalid=4256, Unknown=13, NotChecked=690, Total=5402 [2022-01-31 10:36:57,688 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 35 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 516 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 10:36:57,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 450 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 656 Invalid, 0 Unknown, 516 Unchecked, 0.3s Time] [2022-01-31 10:36:57,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-01-31 10:36:57,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-01-31 10:36:57,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 58 states have internal predecessors, (59), 13 states have call successors, (13), 10 states have call predecessors, (13), 9 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-01-31 10:36:57,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-01-31 10:36:57,692 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 81 [2022-01-31 10:36:57,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:36:57,693 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-01-31 10:36:57,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 2.0) internal successors, (78), 34 states have internal predecessors, (78), 17 states have call successors, (21), 7 states have call predecessors, (21), 5 states have return successors, (18), 17 states have call predecessors, (18), 15 states have call successors, (18) [2022-01-31 10:36:57,693 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-01-31 10:36:57,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-01-31 10:36:57,693 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:36:57,693 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:36:57,709 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-31 10:36:57,894 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-31 10:36:57,894 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:36:57,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:36:57,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1015157090, now seen corresponding path program 9 times [2022-01-31 10:36:57,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:36:57,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525636381] [2022-01-31 10:36:57,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:36:57,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:36:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:58,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:36:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:58,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:36:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:58,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:36:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:58,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:36:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:58,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:36:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:58,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:36:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:58,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:36:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:58,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:36:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:58,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-31 10:36:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:58,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 10:36:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:58,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-01-31 10:36:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:36:58,136 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 21 proven. 78 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-01-31 10:36:58,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:36:58,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525636381] [2022-01-31 10:36:58,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525636381] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:36:58,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855199854] [2022-01-31 10:36:58,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 10:36:58,137 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:36:58,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:36:58,148 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-31 10:36:58,149 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-31 10:36:58,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-01-31 10:36:58,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:36:58,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-31 10:36:58,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:36:58,485 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:37:00,649 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-31 10:37:00,649 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 27 treesize of output 26 [2022-01-31 10:37:01,003 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:37:01,071 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 33 proven. 84 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-01-31 10:37:01,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:37:01,227 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 21 treesize of output 19 [2022-01-31 10:37:01,229 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 37 treesize of output 33 [2022-01-31 10:37:01,430 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 21 proven. 78 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-01-31 10:37:01,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855199854] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:37:01,430 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:37:01,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 37 [2022-01-31 10:37:01,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989976752] [2022-01-31 10:37:01,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:37:01,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-31 10:37:01,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:37:01,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-31 10:37:01,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1208, Unknown=1, NotChecked=0, Total=1332 [2022-01-31 10:37:01,432 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 37 states, 35 states have (on average 2.4) internal successors, (84), 30 states have internal predecessors, (84), 19 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (21), 19 states have call predecessors, (21), 17 states have call successors, (21) [2022-01-31 10:37:02,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:37:02,158 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2022-01-31 10:37:02,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-31 10:37:02,158 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 2.4) internal successors, (84), 30 states have internal predecessors, (84), 19 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (21), 19 states have call predecessors, (21), 17 states have call successors, (21) Word has length 89 [2022-01-31 10:37:02,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:37:02,159 INFO L225 Difference]: With dead ends: 130 [2022-01-31 10:37:02,159 INFO L226 Difference]: Without dead ends: 130 [2022-01-31 10:37:02,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 172 SyntacticMatches, 15 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=319, Invalid=3220, Unknown=1, NotChecked=0, Total=3540 [2022-01-31 10:37:02,161 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 97 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 10:37:02,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 242 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1166 Invalid, 0 Unknown, 141 Unchecked, 0.4s Time] [2022-01-31 10:37:02,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-01-31 10:37:02,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 97. [2022-01-31 10:37:02,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.042857142857143) internal successors, (73), 71 states have internal predecessors, (73), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-01-31 10:37:02,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2022-01-31 10:37:02,164 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 89 [2022-01-31 10:37:02,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:37:02,165 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2022-01-31 10:37:02,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 2.4) internal successors, (84), 30 states have internal predecessors, (84), 19 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (21), 19 states have call predecessors, (21), 17 states have call successors, (21) [2022-01-31 10:37:02,165 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2022-01-31 10:37:02,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-31 10:37:02,165 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:37:02,165 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:37:02,182 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-31 10:37:02,366 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-31 10:37:02,366 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:37:02,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:37:02,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1210728880, now seen corresponding path program 10 times [2022-01-31 10:37:02,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:37:02,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394484793] [2022-01-31 10:37:02,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:37:02,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:37:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:02,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:37:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:02,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:37:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:02,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:37:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:02,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:37:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:02,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:37:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:02,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:37:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:02,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:37:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:02,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:37:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:02,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-31 10:37:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:02,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 10:37:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:02,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-01-31 10:37:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:02,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-31 10:37:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:02,660 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 26 proven. 89 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-01-31 10:37:02,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:37:02,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394484793] [2022-01-31 10:37:02,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394484793] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:37:02,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616853943] [2022-01-31 10:37:02,661 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 10:37:02,661 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:37:02,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:37:02,676 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-31 10:37:02,704 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-31 10:37:02,742 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 10:37:02,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:37:02,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 37 conjunts are in the unsatisfiable core [2022-01-31 10:37:02,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:37:03,083 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 13 treesize of output 9 [2022-01-31 10:37:03,434 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:37:03,518 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 18 proven. 97 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-01-31 10:37:03,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:37:03,623 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 16 treesize of output 14 [2022-01-31 10:37:03,625 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 32 treesize of output 28 [2022-01-31 10:37:03,850 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 26 proven. 89 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-01-31 10:37:03,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616853943] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:37:03,850 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:37:03,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 20] total 38 [2022-01-31 10:37:03,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836500138] [2022-01-31 10:37:03,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:37:03,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-31 10:37:03,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:37:03,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-31 10:37:03,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1286, Unknown=0, NotChecked=0, Total=1406 [2022-01-31 10:37:03,851 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 38 states, 36 states have (on average 2.4166666666666665) internal successors, (87), 31 states have internal predecessors, (87), 21 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (23), 21 states have call predecessors, (23), 19 states have call successors, (23) [2022-01-31 10:37:04,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:37:04,905 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2022-01-31 10:37:04,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-31 10:37:04,905 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 2.4166666666666665) internal successors, (87), 31 states have internal predecessors, (87), 21 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (23), 21 states have call predecessors, (23), 19 states have call successors, (23) Word has length 97 [2022-01-31 10:37:04,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:37:04,906 INFO L225 Difference]: With dead ends: 145 [2022-01-31 10:37:04,906 INFO L226 Difference]: Without dead ends: 145 [2022-01-31 10:37:04,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 190 SyntacticMatches, 13 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=320, Invalid=3340, Unknown=0, NotChecked=0, Total=3660 [2022-01-31 10:37:04,907 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 143 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 2016 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 2264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 2016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 10:37:04,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 247 Invalid, 2264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 2016 Invalid, 0 Unknown, 131 Unchecked, 0.7s Time] [2022-01-31 10:37:04,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-01-31 10:37:04,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 105. [2022-01-31 10:37:04,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 77 states have internal predecessors, (79), 16 states have call successors, (16), 13 states have call predecessors, (16), 12 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-01-31 10:37:04,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2022-01-31 10:37:04,911 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 97 [2022-01-31 10:37:04,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:37:04,911 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2022-01-31 10:37:04,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 2.4166666666666665) internal successors, (87), 31 states have internal predecessors, (87), 21 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (23), 21 states have call predecessors, (23), 19 states have call successors, (23) [2022-01-31 10:37:04,911 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2022-01-31 10:37:04,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-31 10:37:04,911 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:37:04,912 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:37:04,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-01-31 10:37:05,128 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-31 10:37:05,128 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:37:05,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:37:05,128 INFO L85 PathProgramCache]: Analyzing trace with hash 992780156, now seen corresponding path program 11 times [2022-01-31 10:37:05,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:37:05,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769730745] [2022-01-31 10:37:05,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:37:05,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:37:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:05,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:37:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:05,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:37:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:05,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:37:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:05,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:37:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:05,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:37:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:05,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:37:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:05,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:37:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:05,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:37:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:05,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:37:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:05,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 10:37:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:05,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-01-31 10:37:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:05,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-31 10:37:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:05,401 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 21 proven. 105 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-01-31 10:37:05,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:37:05,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769730745] [2022-01-31 10:37:05,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769730745] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:37:05,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988362930] [2022-01-31 10:37:05,402 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 10:37:05,402 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:37:05,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:37:05,403 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-31 10:37:05,441 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-31 10:37:05,486 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-01-31 10:37:05,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:37:05,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-31 10:37:05,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:37:05,730 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:37:05,820 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:37:05,820 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:37:05,898 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:37:05,898 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:37:06,086 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:37:06,136 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 54 proven. 108 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-01-31 10:37:06,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:37:06,300 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 21 treesize of output 19 [2022-01-31 10:37:06,301 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 37 treesize of output 33 [2022-01-31 10:37:06,508 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 21 proven. 104 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-01-31 10:37:06,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988362930] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:37:06,508 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:37:06,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 38 [2022-01-31 10:37:06,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424383368] [2022-01-31 10:37:06,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:37:06,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-31 10:37:06,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:37:06,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-31 10:37:06,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1276, Unknown=0, NotChecked=0, Total=1406 [2022-01-31 10:37:06,511 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand has 38 states, 36 states have (on average 2.4722222222222223) internal successors, (89), 31 states have internal predecessors, (89), 20 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (23), 20 states have call predecessors, (23), 18 states have call successors, (23) [2022-01-31 10:37:07,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:37:07,822 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2022-01-31 10:37:07,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-31 10:37:07,822 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 2.4722222222222223) internal successors, (89), 31 states have internal predecessors, (89), 20 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (23), 20 states have call predecessors, (23), 18 states have call successors, (23) Word has length 97 [2022-01-31 10:37:07,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:37:07,824 INFO L225 Difference]: With dead ends: 141 [2022-01-31 10:37:07,824 INFO L226 Difference]: Without dead ends: 141 [2022-01-31 10:37:07,826 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 187 SyntacticMatches, 19 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1180 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=329, Invalid=3329, Unknown=2, NotChecked=0, Total=3660 [2022-01-31 10:37:07,827 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 89 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 10:37:07,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 188 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1355 Invalid, 0 Unknown, 153 Unchecked, 0.5s Time] [2022-01-31 10:37:07,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-01-31 10:37:07,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2022-01-31 10:37:07,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 88 states have internal predecessors, (89), 18 states have call successors, (18), 15 states have call predecessors, (18), 14 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-01-31 10:37:07,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2022-01-31 10:37:07,832 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 97 [2022-01-31 10:37:07,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:37:07,833 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2022-01-31 10:37:07,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 2.4722222222222223) internal successors, (89), 31 states have internal predecessors, (89), 20 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (23), 20 states have call predecessors, (23), 18 states have call successors, (23) [2022-01-31 10:37:07,833 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2022-01-31 10:37:07,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-31 10:37:07,834 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:37:07,835 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:37:07,851 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-31 10:37:08,051 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-31 10:37:08,051 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:37:08,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:37:08,052 INFO L85 PathProgramCache]: Analyzing trace with hash -39623998, now seen corresponding path program 12 times [2022-01-31 10:37:08,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:37:08,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127273329] [2022-01-31 10:37:08,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:37:08,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:37:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:08,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:37:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:08,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:37:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:08,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:37:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:08,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:37:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:08,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:37:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:08,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:37:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:08,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:37:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:08,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:37:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:08,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-31 10:37:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:08,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 10:37:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:08,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-01-31 10:37:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:08,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-31 10:37:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:08,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 10:37:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:08,176 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 43 proven. 62 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-01-31 10:37:08,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:37:08,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127273329] [2022-01-31 10:37:08,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127273329] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:37:08,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475173261] [2022-01-31 10:37:08,177 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 10:37:08,177 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:37:08,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:37:08,192 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-31 10:37:08,229 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-31 10:37:08,295 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-01-31 10:37:08,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:37:08,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-31 10:37:08,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:37:08,520 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 60 proven. 45 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-01-31 10:37:08,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:37:08,644 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 60 proven. 45 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-01-31 10:37:08,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475173261] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:37:08,644 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:37:08,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 24 [2022-01-31 10:37:08,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116495246] [2022-01-31 10:37:08,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:37:08,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 10:37:08,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:37:08,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 10:37:08,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2022-01-31 10:37:08,646 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 19 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (20), 18 states have call predecessors, (20), 18 states have call successors, (20) [2022-01-31 10:37:08,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:37:08,923 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2022-01-31 10:37:08,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 10:37:08,923 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 19 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (20), 18 states have call predecessors, (20), 18 states have call successors, (20) Word has length 105 [2022-01-31 10:37:08,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:37:08,924 INFO L225 Difference]: With dead ends: 143 [2022-01-31 10:37:08,924 INFO L226 Difference]: Without dead ends: 113 [2022-01-31 10:37:08,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 227 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=322, Invalid=1084, Unknown=0, NotChecked=0, Total=1406 [2022-01-31 10:37:08,926 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 101 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 10:37:08,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 82 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 10:37:08,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-01-31 10:37:08,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 100. [2022-01-31 10:37:08,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 73 states have internal predecessors, (74), 15 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-01-31 10:37:08,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2022-01-31 10:37:08,933 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 105 [2022-01-31 10:37:08,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:37:08,933 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2022-01-31 10:37:08,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 19 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (20), 18 states have call predecessors, (20), 18 states have call successors, (20) [2022-01-31 10:37:08,933 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2022-01-31 10:37:08,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-31 10:37:08,933 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:37:08,934 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:37:08,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-01-31 10:37:09,150 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-31 10:37:09,151 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:37:09,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:37:09,151 INFO L85 PathProgramCache]: Analyzing trace with hash -780061554, now seen corresponding path program 13 times [2022-01-31 10:37:09,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:37:09,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197286727] [2022-01-31 10:37:09,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:37:09,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:37:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:09,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:37:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:09,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:37:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:09,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:37:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:09,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:37:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:09,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:37:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:09,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:37:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:09,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:37:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:09,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:37:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:09,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:37:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:09,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 10:37:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:09,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-01-31 10:37:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:09,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-31 10:37:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:09,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 10:37:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:09,470 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 26 proven. 116 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-01-31 10:37:09,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:37:09,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197286727] [2022-01-31 10:37:09,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197286727] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:37:09,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294602926] [2022-01-31 10:37:09,471 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 10:37:09,471 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:37:09,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:37:09,488 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-31 10:37:09,547 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-31 10:37:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:09,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 40 conjunts are in the unsatisfiable core [2022-01-31 10:37:09,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:37:09,922 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:37:10,083 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-31 10:37:10,083 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 27 treesize of output 26 [2022-01-31 10:37:10,613 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:37:10,688 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 40 proven. 124 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-01-31 10:37:10,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:37:10,849 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 21 treesize of output 19 [2022-01-31 10:37:10,851 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 37 treesize of output 33 [2022-01-31 10:37:11,118 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 26 proven. 116 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-01-31 10:37:11,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294602926] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:37:11,119 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:37:11,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 41 [2022-01-31 10:37:11,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475705547] [2022-01-31 10:37:11,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:37:11,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-31 10:37:11,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:37:11,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-31 10:37:11,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1501, Unknown=0, NotChecked=0, Total=1640 [2022-01-31 10:37:11,120 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. Second operand has 41 states, 39 states have (on average 2.4615384615384617) internal successors, (96), 34 states have internal predecessors, (96), 23 states have call successors, (29), 5 states have call predecessors, (29), 3 states have return successors, (25), 23 states have call predecessors, (25), 21 states have call successors, (25) [2022-01-31 10:37:11,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:37:11,766 INFO L93 Difference]: Finished difference Result 148 states and 154 transitions. [2022-01-31 10:37:11,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-31 10:37:11,768 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 2.4615384615384617) internal successors, (96), 34 states have internal predecessors, (96), 23 states have call successors, (29), 5 states have call predecessors, (29), 3 states have return successors, (25), 23 states have call predecessors, (25), 21 states have call successors, (25) Word has length 105 [2022-01-31 10:37:11,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:37:11,771 INFO L225 Difference]: With dead ends: 148 [2022-01-31 10:37:11,771 INFO L226 Difference]: Without dead ends: 148 [2022-01-31 10:37:11,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 207 SyntacticMatches, 17 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=336, Invalid=3696, Unknown=0, NotChecked=0, Total=4032 [2022-01-31 10:37:11,772 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 85 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 10:37:11,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 215 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1035 Invalid, 0 Unknown, 109 Unchecked, 0.3s Time] [2022-01-31 10:37:11,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-01-31 10:37:11,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2022-01-31 10:37:11,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 106 states have (on average 1.028301886792453) internal successors, (109), 107 states have internal predecessors, (109), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-01-31 10:37:11,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 150 transitions. [2022-01-31 10:37:11,794 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 150 transitions. Word has length 105 [2022-01-31 10:37:11,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:37:11,794 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 150 transitions. [2022-01-31 10:37:11,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 2.4615384615384617) internal successors, (96), 34 states have internal predecessors, (96), 23 states have call successors, (29), 5 states have call predecessors, (29), 3 states have return successors, (25), 23 states have call predecessors, (25), 21 states have call successors, (25) [2022-01-31 10:37:11,794 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 150 transitions. [2022-01-31 10:37:11,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-31 10:37:11,795 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:37:11,795 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:37:11,832 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-31 10:37:12,007 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-31 10:37:12,008 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:37:12,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:37:12,008 INFO L85 PathProgramCache]: Analyzing trace with hash 356554656, now seen corresponding path program 14 times [2022-01-31 10:37:12,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:37:12,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103352073] [2022-01-31 10:37:12,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:37:12,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:37:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:12,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:37:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:12,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:37:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:12,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:37:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:12,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:37:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:12,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:37:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:12,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:37:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:12,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:37:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:12,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:37:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:12,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:37:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:12,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 10:37:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:12,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-01-31 10:37:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:12,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-31 10:37:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:12,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 10:37:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:12,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-31 10:37:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:37:12,275 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 31 proven. 131 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-01-31 10:37:12,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:37:12,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103352073] [2022-01-31 10:37:12,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103352073] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:37:12,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715870055] [2022-01-31 10:37:12,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 10:37:12,275 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:37:12,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:37:12,276 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-31 10:37:12,304 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-31 10:37:12,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 10:37:12,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:37:12,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-31 10:37:12,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:37:12,695 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:37:14,167 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_62| Int) (v_main_~i~0_198 Int) (|v_main_~#a~0.offset_BEFORE_CALL_62| Int)) (and (<= v_main_~i~0_198 6) (< (+ v_main_~i~0_198 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_62|) (+ (* 4 v_main_~i~0_198) |v_main_~#a~0.offset_BEFORE_CALL_62|))))) is different from true [2022-01-31 10:37:15,638 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_63| Int) (v_main_~i~0_198 Int) (|v_main_~#a~0.offset_BEFORE_CALL_63| Int)) (and (<= v_main_~i~0_198 6) (< (+ v_main_~i~0_198 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_63|) (+ (* 4 v_main_~i~0_198) |v_main_~#a~0.offset_BEFORE_CALL_63|))))) is different from true [2022-01-31 10:37:17,102 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_198 Int) (|v_main_~#a~0.offset_BEFORE_CALL_64| Int) (|v_main_~#a~0.base_BEFORE_CALL_64| Int)) (and (<= v_main_~i~0_198 6) (< (+ v_main_~i~0_198 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_64|) (+ (* 4 v_main_~i~0_198) |v_main_~#a~0.offset_BEFORE_CALL_64|))))) is different from true [2022-01-31 10:37:18,630 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_198 Int) (|v_main_~#a~0.offset_BEFORE_CALL_65| Int) (|v_main_~#a~0.base_BEFORE_CALL_65| Int)) (and (< (+ v_main_~i~0_198 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_65|) (+ (* 4 v_main_~i~0_198) |v_main_~#a~0.offset_BEFORE_CALL_65|))) (<= v_main_~i~0_198 6))) is different from true [2022-01-31 10:37:20,178 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.offset_BEFORE_CALL_66| Int) (v_main_~i~0_198 Int) (|v_main_~#a~0.base_BEFORE_CALL_66| Int)) (and (<= v_main_~i~0_198 6) (< (+ v_main_~i~0_198 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_66|) (+ (* 4 v_main_~i~0_198) |v_main_~#a~0.offset_BEFORE_CALL_66|))))) is different from true [2022-01-31 10:37:26,236 INFO L353 Elim1Store]: treesize reduction 33, result has 42.1 percent of original size [2022-01-31 10:37:26,236 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 38 treesize of output 37 [2022-01-31 10:37:26,323 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 66 proven. 86 refuted. 0 times theorem prover too weak. 76 trivial. 50 not checked. [2022-01-31 10:37:26,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:37:26,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715870055] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:37:26,431 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 10:37:26,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 30] total 50 [2022-01-31 10:37:26,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574233688] [2022-01-31 10:37:26,431 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 10:37:26,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-01-31 10:37:26,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:37:26,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-01-31 10:37:26,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1992, Unknown=6, NotChecked=470, Total=2652 [2022-01-31 10:37:26,432 INFO L87 Difference]: Start difference. First operand 145 states and 150 transitions. Second operand has 50 states, 48 states have (on average 2.25) internal successors, (108), 43 states have internal predecessors, (108), 25 states have call successors, (29), 9 states have call predecessors, (29), 7 states have return successors, (26), 25 states have call predecessors, (26), 23 states have call successors, (26) [2022-01-31 10:37:29,502 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_63| Int) (v_main_~i~0_198 Int) (|v_main_~#a~0.offset_BEFORE_CALL_63| Int)) (and (<= v_main_~i~0_198 6) (< (+ v_main_~i~0_198 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_63|) (+ (* 4 v_main_~i~0_198) |v_main_~#a~0.offset_BEFORE_CALL_63|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_62| Int) (v_main_~i~0_198 Int) (|v_main_~#a~0.offset_BEFORE_CALL_62| Int)) (and (<= v_main_~i~0_198 6) (< (+ v_main_~i~0_198 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_62|) (+ (* 4 v_main_~i~0_198) |v_main_~#a~0.offset_BEFORE_CALL_62|)))))) is different from true [2022-01-31 10:37:31,311 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_198 Int) (|v_main_~#a~0.offset_BEFORE_CALL_64| Int) (|v_main_~#a~0.base_BEFORE_CALL_64| Int)) (and (<= v_main_~i~0_198 6) (< (+ v_main_~i~0_198 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_64|) (+ (* 4 v_main_~i~0_198) |v_main_~#a~0.offset_BEFORE_CALL_64|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_63| Int) (v_main_~i~0_198 Int) (|v_main_~#a~0.offset_BEFORE_CALL_63| Int)) (and (<= v_main_~i~0_198 6) (< (+ v_main_~i~0_198 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_63|) (+ (* 4 v_main_~i~0_198) |v_main_~#a~0.offset_BEFORE_CALL_63|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_62| Int) (v_main_~i~0_198 Int) (|v_main_~#a~0.offset_BEFORE_CALL_62| Int)) (and (<= v_main_~i~0_198 6) (< (+ v_main_~i~0_198 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_62|) (+ (* 4 v_main_~i~0_198) |v_main_~#a~0.offset_BEFORE_CALL_62|)))))) is different from true [2022-01-31 10:37:32,916 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_198 Int) (|v_main_~#a~0.offset_BEFORE_CALL_64| Int) (|v_main_~#a~0.base_BEFORE_CALL_64| Int)) (and (<= v_main_~i~0_198 6) (< (+ v_main_~i~0_198 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_64|) (+ (* 4 v_main_~i~0_198) |v_main_~#a~0.offset_BEFORE_CALL_64|))))) (exists ((v_main_~i~0_198 Int) (|v_main_~#a~0.offset_BEFORE_CALL_65| Int) (|v_main_~#a~0.base_BEFORE_CALL_65| Int)) (and (< (+ v_main_~i~0_198 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_65|) (+ (* 4 v_main_~i~0_198) |v_main_~#a~0.offset_BEFORE_CALL_65|))) (<= v_main_~i~0_198 6))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_63| Int) (v_main_~i~0_198 Int) (|v_main_~#a~0.offset_BEFORE_CALL_63| Int)) (and (<= v_main_~i~0_198 6) (< (+ v_main_~i~0_198 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_63|) (+ (* 4 v_main_~i~0_198) |v_main_~#a~0.offset_BEFORE_CALL_63|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_62| Int) (v_main_~i~0_198 Int) (|v_main_~#a~0.offset_BEFORE_CALL_62| Int)) (and (<= v_main_~i~0_198 6) (< (+ v_main_~i~0_198 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_62|) (+ (* 4 v_main_~i~0_198) |v_main_~#a~0.offset_BEFORE_CALL_62|)))))) is different from true [2022-01-31 10:37:36,464 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_198 Int) (|v_main_~#a~0.offset_BEFORE_CALL_64| Int) (|v_main_~#a~0.base_BEFORE_CALL_64| Int)) (and (<= v_main_~i~0_198 6) (< (+ v_main_~i~0_198 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_64|) (+ (* 4 v_main_~i~0_198) |v_main_~#a~0.offset_BEFORE_CALL_64|))))) (exists ((v_main_~i~0_198 Int) (|v_main_~#a~0.offset_BEFORE_CALL_65| Int) (|v_main_~#a~0.base_BEFORE_CALL_65| Int)) (and (< (+ v_main_~i~0_198 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_65|) (+ (* 4 v_main_~i~0_198) |v_main_~#a~0.offset_BEFORE_CALL_65|))) (<= v_main_~i~0_198 6))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_63| Int) (v_main_~i~0_198 Int) (|v_main_~#a~0.offset_BEFORE_CALL_63| Int)) (and (<= v_main_~i~0_198 6) (< (+ v_main_~i~0_198 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_63|) (+ (* 4 v_main_~i~0_198) |v_main_~#a~0.offset_BEFORE_CALL_63|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_62| Int) (v_main_~i~0_198 Int) (|v_main_~#a~0.offset_BEFORE_CALL_62| Int)) (and (<= v_main_~i~0_198 6) (< (+ v_main_~i~0_198 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_62|) (+ (* 4 v_main_~i~0_198) |v_main_~#a~0.offset_BEFORE_CALL_62|))))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_66| Int) (v_main_~i~0_198 Int) (|v_main_~#a~0.base_BEFORE_CALL_66| Int)) (and (<= v_main_~i~0_198 6) (< (+ v_main_~i~0_198 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_66|) (+ (* 4 v_main_~i~0_198) |v_main_~#a~0.offset_BEFORE_CALL_66|)))))) is different from true [2022-01-31 10:38:00,384 WARN L228 SmtUtils]: Spent 7.26s on a formula simplification. DAG size of input: 51 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 10:38:00,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:38:00,406 INFO L93 Difference]: Finished difference Result 157 states and 163 transitions. [2022-01-31 10:38:00,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-31 10:38:00,407 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 43 states have internal predecessors, (108), 25 states have call successors, (29), 9 states have call predecessors, (29), 7 states have return successors, (26), 25 states have call predecessors, (26), 23 states have call successors, (26) Word has length 113 [2022-01-31 10:38:00,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:38:00,407 INFO L225 Difference]: With dead ends: 157 [2022-01-31 10:38:00,407 INFO L226 Difference]: Without dead ends: 109 [2022-01-31 10:38:00,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 127 SyntacticMatches, 5 SemanticMatches, 93 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2006 ImplicationChecksByTransitivity, 47.3s TimeCoverageRelationStatistics Valid=621, Invalid=6709, Unknown=16, NotChecked=1584, Total=8930 [2022-01-31 10:38:00,410 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 58 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 1752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 839 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 10:38:00,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 428 Invalid, 1752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 848 Invalid, 0 Unknown, 839 Unchecked, 0.3s Time] [2022-01-31 10:38:00,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-01-31 10:38:00,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2022-01-31 10:38:00,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 79 states have internal predecessors, (80), 16 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-01-31 10:38:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2022-01-31 10:38:00,412 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 113 [2022-01-31 10:38:00,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:38:00,412 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2022-01-31 10:38:00,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 43 states have internal predecessors, (108), 25 states have call successors, (29), 9 states have call predecessors, (29), 7 states have return successors, (26), 25 states have call predecessors, (26), 23 states have call successors, (26) [2022-01-31 10:38:00,413 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2022-01-31 10:38:00,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-31 10:38:00,413 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:38:00,413 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 7, 7, 7, 7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:38:00,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-01-31 10:38:00,619 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-31 10:38:00,620 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:38:00,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:38:00,620 INFO L85 PathProgramCache]: Analyzing trace with hash -383882900, now seen corresponding path program 15 times [2022-01-31 10:38:00,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:38:00,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906318544] [2022-01-31 10:38:00,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:38:00,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:38:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:00,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:38:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:00,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:38:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:00,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:38:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:00,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:38:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:00,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:38:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:00,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:38:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:00,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:38:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:00,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:38:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:00,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:38:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:00,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:38:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:00,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-01-31 10:38:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:00,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-31 10:38:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:00,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 10:38:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:00,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-31 10:38:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:00,932 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 26 proven. 147 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-01-31 10:38:00,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:38:00,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906318544] [2022-01-31 10:38:00,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906318544] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:38:00,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736233472] [2022-01-31 10:38:00,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 10:38:00,932 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:38:00,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:38:00,941 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-31 10:38:00,963 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-31 10:38:01,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-01-31 10:38:01,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:38:01,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 43 conjunts are in the unsatisfiable core [2022-01-31 10:38:01,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:38:01,401 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:38:01,487 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:38:01,487 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:38:01,585 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:38:01,585 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:38:01,934 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:38:01,994 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 65 proven. 152 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-01-31 10:38:01,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:38:02,132 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 21 treesize of output 19 [2022-01-31 10:38:02,134 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 37 treesize of output 33 [2022-01-31 10:38:02,291 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 26 proven. 146 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-01-31 10:38:02,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736233472] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:38:02,291 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:38:02,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 42 [2022-01-31 10:38:02,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135058020] [2022-01-31 10:38:02,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:38:02,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-01-31 10:38:02,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:38:02,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-01-31 10:38:02,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1576, Unknown=0, NotChecked=0, Total=1722 [2022-01-31 10:38:02,294 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand has 42 states, 40 states have (on average 2.525) internal successors, (101), 35 states have internal predecessors, (101), 24 states have call successors, (31), 5 states have call predecessors, (31), 3 states have return successors, (27), 24 states have call predecessors, (27), 22 states have call successors, (27) [2022-01-31 10:38:02,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:38:02,958 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2022-01-31 10:38:02,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-31 10:38:02,958 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 2.525) internal successors, (101), 35 states have internal predecessors, (101), 24 states have call successors, (31), 5 states have call predecessors, (31), 3 states have return successors, (27), 24 states have call predecessors, (27), 22 states have call successors, (27) Word has length 113 [2022-01-31 10:38:02,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:38:02,961 INFO L225 Difference]: With dead ends: 122 [2022-01-31 10:38:02,961 INFO L226 Difference]: Without dead ends: 122 [2022-01-31 10:38:02,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 219 SyntacticMatches, 21 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1479 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=364, Invalid=4058, Unknown=0, NotChecked=0, Total=4422 [2022-01-31 10:38:02,962 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 117 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 1563 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 10:38:02,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 202 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1563 Invalid, 0 Unknown, 148 Unchecked, 0.4s Time] [2022-01-31 10:38:02,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-01-31 10:38:02,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2022-01-31 10:38:02,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 85 states have internal predecessors, (86), 17 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-01-31 10:38:02,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2022-01-31 10:38:02,979 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 113 [2022-01-31 10:38:02,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:38:02,979 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2022-01-31 10:38:02,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 2.525) internal successors, (101), 35 states have internal predecessors, (101), 24 states have call successors, (31), 5 states have call predecessors, (31), 3 states have return successors, (27), 24 states have call predecessors, (27), 22 states have call successors, (27) [2022-01-31 10:38:02,979 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2022-01-31 10:38:02,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-31 10:38:02,980 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:38:02,980 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:38:02,999 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-31 10:38:03,193 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-31 10:38:03,194 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:38:03,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:38:03,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1178464642, now seen corresponding path program 16 times [2022-01-31 10:38:03,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:38:03,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527548674] [2022-01-31 10:38:03,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:38:03,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:38:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:03,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:38:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:03,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:38:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:03,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:38:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:03,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:38:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:03,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:38:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:03,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:38:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:03,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:38:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:03,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:38:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:03,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:38:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:03,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:38:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:03,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-01-31 10:38:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:03,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-31 10:38:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:03,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 10:38:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:03,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-31 10:38:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:03,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-31 10:38:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:03,592 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 31 proven. 162 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2022-01-31 10:38:03,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:38:03,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527548674] [2022-01-31 10:38:03,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527548674] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:38:03,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272170193] [2022-01-31 10:38:03,592 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 10:38:03,592 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:38:03,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:38:03,593 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-31 10:38:03,594 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-31 10:38:03,665 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 10:38:03,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:38:03,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 44 conjunts are in the unsatisfiable core [2022-01-31 10:38:03,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:38:04,028 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:38:06,197 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-31 10:38:06,197 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 27 treesize of output 26 [2022-01-31 10:38:06,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:38:06,894 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 47 proven. 172 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-01-31 10:38:06,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:38:07,085 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 21 treesize of output 19 [2022-01-31 10:38:07,087 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 37 treesize of output 33 [2022-01-31 10:38:07,371 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 31 proven. 162 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2022-01-31 10:38:07,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272170193] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:38:07,371 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:38:07,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 47 [2022-01-31 10:38:07,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038610396] [2022-01-31 10:38:07,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:38:07,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-31 10:38:07,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:38:07,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-31 10:38:07,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1997, Unknown=1, NotChecked=0, Total=2162 [2022-01-31 10:38:07,375 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand has 47 states, 44 states have (on average 2.477272727272727) internal successors, (109), 39 states have internal predecessors, (109), 28 states have call successors, (34), 5 states have call predecessors, (34), 3 states have return successors, (30), 28 states have call predecessors, (30), 26 states have call successors, (30) [2022-01-31 10:38:08,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:38:08,431 INFO L93 Difference]: Finished difference Result 177 states and 182 transitions. [2022-01-31 10:38:08,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-31 10:38:08,431 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 2.477272727272727) internal successors, (109), 39 states have internal predecessors, (109), 28 states have call successors, (34), 5 states have call predecessors, (34), 3 states have return successors, (30), 28 states have call predecessors, (30), 26 states have call successors, (30) Word has length 121 [2022-01-31 10:38:08,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:38:08,432 INFO L225 Difference]: With dead ends: 177 [2022-01-31 10:38:08,432 INFO L226 Difference]: Without dead ends: 177 [2022-01-31 10:38:08,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 233 SyntacticMatches, 20 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1753 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=395, Invalid=4860, Unknown=1, NotChecked=0, Total=5256 [2022-01-31 10:38:08,433 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 102 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 1899 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 2123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 10:38:08,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 344 Invalid, 2123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1899 Invalid, 0 Unknown, 146 Unchecked, 0.6s Time] [2022-01-31 10:38:08,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-01-31 10:38:08,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 133. [2022-01-31 10:38:08,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 97 states have (on average 1.0309278350515463) internal successors, (100), 98 states have internal predecessors, (100), 19 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-01-31 10:38:08,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2022-01-31 10:38:08,436 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 121 [2022-01-31 10:38:08,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:38:08,437 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2022-01-31 10:38:08,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 2.477272727272727) internal successors, (109), 39 states have internal predecessors, (109), 28 states have call successors, (34), 5 states have call predecessors, (34), 3 states have return successors, (30), 28 states have call predecessors, (30), 26 states have call successors, (30) [2022-01-31 10:38:08,437 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2022-01-31 10:38:08,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-01-31 10:38:08,437 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:38:08,437 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:38:08,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-01-31 10:38:08,646 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-31 10:38:08,647 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:38:08,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:38:08,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1077902960, now seen corresponding path program 17 times [2022-01-31 10:38:08,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:38:08,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148975317] [2022-01-31 10:38:08,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:38:08,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:38:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:08,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:38:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:08,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:38:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:08,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:38:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:08,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:38:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:09,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:38:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:09,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:38:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:09,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:38:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:09,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:38:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:09,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:38:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:09,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:38:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:09,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-01-31 10:38:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:09,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-31 10:38:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:09,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 10:38:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:09,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-31 10:38:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:09,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-31 10:38:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:09,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-01-31 10:38:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:09,030 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 36 proven. 181 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-01-31 10:38:09,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:38:09,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148975317] [2022-01-31 10:38:09,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148975317] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:38:09,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073397490] [2022-01-31 10:38:09,030 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 10:38:09,030 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:38:09,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:38:09,031 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-31 10:38:09,062 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-31 10:38:09,126 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-01-31 10:38:09,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:38:09,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 45 conjunts are in the unsatisfiable core [2022-01-31 10:38:09,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:38:09,545 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 13 treesize of output 9 [2022-01-31 10:38:10,006 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:38:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 24 proven. 193 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-01-31 10:38:10,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:38:10,160 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 16 treesize of output 14 [2022-01-31 10:38:10,162 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 32 treesize of output 28 [2022-01-31 10:38:10,478 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 36 proven. 181 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-01-31 10:38:10,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073397490] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:38:10,478 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:38:10,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 24] total 48 [2022-01-31 10:38:10,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127245099] [2022-01-31 10:38:10,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:38:10,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-31 10:38:10,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:38:10,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-31 10:38:10,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2097, Unknown=0, NotChecked=0, Total=2256 [2022-01-31 10:38:10,479 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand has 48 states, 45 states have (on average 2.488888888888889) internal successors, (112), 40 states have internal predecessors, (112), 30 states have call successors, (36), 5 states have call predecessors, (36), 3 states have return successors, (32), 30 states have call predecessors, (32), 28 states have call successors, (32) [2022-01-31 10:38:11,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:38:11,845 INFO L93 Difference]: Finished difference Result 197 states and 205 transitions. [2022-01-31 10:38:11,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-01-31 10:38:11,846 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 2.488888888888889) internal successors, (112), 40 states have internal predecessors, (112), 30 states have call successors, (36), 5 states have call predecessors, (36), 3 states have return successors, (32), 30 states have call predecessors, (32), 28 states have call successors, (32) Word has length 129 [2022-01-31 10:38:11,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:38:11,847 INFO L225 Difference]: With dead ends: 197 [2022-01-31 10:38:11,847 INFO L226 Difference]: Without dead ends: 197 [2022-01-31 10:38:11,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 253 SyntacticMatches, 17 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1713 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=393, Invalid=5009, Unknown=0, NotChecked=0, Total=5402 [2022-01-31 10:38:11,847 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 168 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 2697 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 3115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 2697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 10:38:11,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 314 Invalid, 3115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 2697 Invalid, 0 Unknown, 272 Unchecked, 0.9s Time] [2022-01-31 10:38:11,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-01-31 10:38:11,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 141. [2022-01-31 10:38:11,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 103 states have (on average 1.029126213592233) internal successors, (106), 104 states have internal predecessors, (106), 20 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-01-31 10:38:11,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 145 transitions. [2022-01-31 10:38:11,853 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 145 transitions. Word has length 129 [2022-01-31 10:38:11,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:38:11,853 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 145 transitions. [2022-01-31 10:38:11,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 2.488888888888889) internal successors, (112), 40 states have internal predecessors, (112), 30 states have call successors, (36), 5 states have call predecessors, (36), 3 states have return successors, (32), 30 states have call predecessors, (32), 28 states have call successors, (32) [2022-01-31 10:38:11,854 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2022-01-31 10:38:11,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-01-31 10:38:11,854 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:38:11,854 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:38:11,873 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-31 10:38:12,071 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-31 10:38:12,072 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:38:12,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:38:12,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1808123740, now seen corresponding path program 18 times [2022-01-31 10:38:12,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:38:12,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422076711] [2022-01-31 10:38:12,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:38:12,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:38:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:12,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:38:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:12,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:38:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:12,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:38:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:12,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:38:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:12,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:38:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:12,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:38:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:12,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:38:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:12,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:38:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:12,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:38:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:12,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:38:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:12,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:38:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:12,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-31 10:38:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:12,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 10:38:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:12,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-31 10:38:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:12,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-31 10:38:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:12,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-01-31 10:38:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:12,466 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 31 proven. 197 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-01-31 10:38:12,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:38:12,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422076711] [2022-01-31 10:38:12,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422076711] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:38:12,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533809788] [2022-01-31 10:38:12,466 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 10:38:12,466 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:38:12,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:38:12,480 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-31 10:38:12,515 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-31 10:38:12,615 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-01-31 10:38:12,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:38:12,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 47 conjunts are in the unsatisfiable core [2022-01-31 10:38:12,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:38:12,961 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:38:13,057 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:38:13,058 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:38:13,157 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:38:13,158 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:38:13,617 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:38:13,698 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 76 proven. 204 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-01-31 10:38:13,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:38:13,918 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 21 treesize of output 19 [2022-01-31 10:38:13,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 37 treesize of output 33 [2022-01-31 10:38:14,104 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 31 proven. 196 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-01-31 10:38:14,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533809788] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:38:14,105 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:38:14,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 46 [2022-01-31 10:38:14,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152556792] [2022-01-31 10:38:14,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:38:14,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-31 10:38:14,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:38:14,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-31 10:38:14,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1908, Unknown=0, NotChecked=0, Total=2070 [2022-01-31 10:38:14,106 INFO L87 Difference]: Start difference. First operand 141 states and 145 transitions. Second operand has 46 states, 44 states have (on average 2.5681818181818183) internal successors, (113), 39 states have internal predecessors, (113), 28 states have call successors, (35), 5 states have call predecessors, (35), 3 states have return successors, (31), 28 states have call predecessors, (31), 26 states have call successors, (31) [2022-01-31 10:38:15,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:38:15,551 INFO L93 Difference]: Finished difference Result 177 states and 184 transitions. [2022-01-31 10:38:15,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-31 10:38:15,553 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 2.5681818181818183) internal successors, (113), 39 states have internal predecessors, (113), 28 states have call successors, (35), 5 states have call predecessors, (35), 3 states have return successors, (31), 28 states have call predecessors, (31), 26 states have call successors, (31) Word has length 129 [2022-01-31 10:38:15,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:38:15,554 INFO L225 Difference]: With dead ends: 177 [2022-01-31 10:38:15,554 INFO L226 Difference]: Without dead ends: 177 [2022-01-31 10:38:15,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 255 SyntacticMatches, 23 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1811 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=394, Invalid=4859, Unknown=3, NotChecked=0, Total=5256 [2022-01-31 10:38:15,555 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 127 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 1572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 10:38:15,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 217 Invalid, 1572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1350 Invalid, 0 Unknown, 148 Unchecked, 0.4s Time] [2022-01-31 10:38:15,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-01-31 10:38:15,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 159. [2022-01-31 10:38:15,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 116 states have (on average 1.0258620689655173) internal successors, (119), 118 states have internal predecessors, (119), 24 states have call successors, (24), 19 states have call predecessors, (24), 18 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-01-31 10:38:15,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 166 transitions. [2022-01-31 10:38:15,558 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 166 transitions. Word has length 129 [2022-01-31 10:38:15,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:38:15,559 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 166 transitions. [2022-01-31 10:38:15,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 2.5681818181818183) internal successors, (113), 39 states have internal predecessors, (113), 28 states have call successors, (35), 5 states have call predecessors, (35), 3 states have return successors, (31), 28 states have call predecessors, (31), 26 states have call successors, (31) [2022-01-31 10:38:15,559 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 166 transitions. [2022-01-31 10:38:15,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-01-31 10:38:15,559 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:38:15,559 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:38:15,576 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-31 10:38:15,760 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-31 10:38:15,760 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:38:15,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:38:15,760 INFO L85 PathProgramCache]: Analyzing trace with hash 309052066, now seen corresponding path program 19 times [2022-01-31 10:38:15,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:38:15,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235473924] [2022-01-31 10:38:15,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:38:15,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:38:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:15,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:38:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:15,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:38:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:15,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:38:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:15,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:38:15,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:15,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:38:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:15,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:38:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:15,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:38:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:15,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:38:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:15,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:38:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:15,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:38:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:15,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-01-31 10:38:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:15,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-31 10:38:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:15,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 10:38:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:15,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-31 10:38:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:15,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-31 10:38:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:15,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-01-31 10:38:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:15,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-31 10:38:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:15,925 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 87 proven. 116 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2022-01-31 10:38:15,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:38:15,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235473924] [2022-01-31 10:38:15,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235473924] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:38:15,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775056221] [2022-01-31 10:38:15,925 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 10:38:15,925 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:38:15,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:38:15,936 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-31 10:38:15,936 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-31 10:38:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:16,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-31 10:38:16,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:38:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 112 proven. 91 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2022-01-31 10:38:16,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:38:16,511 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 112 proven. 91 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2022-01-31 10:38:16,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775056221] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:38:16,511 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:38:16,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 30 [2022-01-31 10:38:16,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280167986] [2022-01-31 10:38:16,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:38:16,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-31 10:38:16,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:38:16,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-31 10:38:16,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=665, Unknown=0, NotChecked=0, Total=870 [2022-01-31 10:38:16,513 INFO L87 Difference]: Start difference. First operand 159 states and 166 transitions. Second operand has 30 states, 30 states have (on average 3.033333333333333) internal successors, (91), 29 states have internal predecessors, (91), 25 states have call successors, (29), 3 states have call predecessors, (29), 1 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2022-01-31 10:38:16,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:38:16,944 INFO L93 Difference]: Finished difference Result 183 states and 194 transitions. [2022-01-31 10:38:16,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 10:38:16,944 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.033333333333333) internal successors, (91), 29 states have internal predecessors, (91), 25 states have call successors, (29), 3 states have call predecessors, (29), 1 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) Word has length 137 [2022-01-31 10:38:16,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:38:16,945 INFO L225 Difference]: With dead ends: 183 [2022-01-31 10:38:16,945 INFO L226 Difference]: Without dead ends: 145 [2022-01-31 10:38:16,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 297 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=500, Invalid=1756, Unknown=0, NotChecked=0, Total=2256 [2022-01-31 10:38:16,946 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 125 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 10:38:16,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 76 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 10:38:16,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-01-31 10:38:16,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2022-01-31 10:38:16,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 97 states have internal predecessors, (98), 19 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-01-31 10:38:16,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 135 transitions. [2022-01-31 10:38:16,949 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 135 transitions. Word has length 137 [2022-01-31 10:38:16,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:38:16,949 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 135 transitions. [2022-01-31 10:38:16,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.033333333333333) internal successors, (91), 29 states have internal predecessors, (91), 25 states have call successors, (29), 3 states have call predecessors, (29), 1 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2022-01-31 10:38:16,949 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2022-01-31 10:38:16,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-01-31 10:38:16,950 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:38:16,950 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:38:16,987 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-31 10:38:17,150 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-31 10:38:17,150 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:38:17,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:38:17,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2115732370, now seen corresponding path program 20 times [2022-01-31 10:38:17,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:38:17,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831569679] [2022-01-31 10:38:17,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:38:17,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:38:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:17,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:38:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:17,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:38:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:17,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:38:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:17,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:38:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:17,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:38:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:17,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:38:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:17,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:38:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:17,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:38:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:17,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:38:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:17,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:38:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:17,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:38:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:17,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-31 10:38:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:17,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 10:38:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:17,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-31 10:38:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:17,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-31 10:38:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:17,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-01-31 10:38:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:17,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-31 10:38:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:17,542 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 36 proven. 216 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-01-31 10:38:17,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:38:17,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831569679] [2022-01-31 10:38:17,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831569679] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:38:17,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694747796] [2022-01-31 10:38:17,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 10:38:17,542 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:38:17,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:38:17,550 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-31 10:38:17,551 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-31 10:38:17,626 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 10:38:17,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:38:17,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 48 conjunts are in the unsatisfiable core [2022-01-31 10:38:17,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:38:18,034 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:38:18,208 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-31 10:38:18,208 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 27 treesize of output 26 [2022-01-31 10:38:19,212 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:38:19,266 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 54 proven. 228 refuted. 20 times theorem prover too weak. 142 trivial. 0 not checked. [2022-01-31 10:38:19,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:38:19,396 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 21 treesize of output 19 [2022-01-31 10:38:19,398 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 37 treesize of output 33 [2022-01-31 10:38:19,578 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 36 proven. 216 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-01-31 10:38:19,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694747796] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:38:19,578 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:38:19,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 26] total 50 [2022-01-31 10:38:19,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722117582] [2022-01-31 10:38:19,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:38:19,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-01-31 10:38:19,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:38:19,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-01-31 10:38:19,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2264, Unknown=1, NotChecked=0, Total=2450 [2022-01-31 10:38:19,580 INFO L87 Difference]: Start difference. First operand 132 states and 135 transitions. Second operand has 50 states, 48 states have (on average 2.5625) internal successors, (123), 43 states have internal predecessors, (123), 31 states have call successors, (37), 6 states have call predecessors, (37), 4 states have return successors, (33), 31 states have call predecessors, (33), 29 states have call successors, (33) [2022-01-31 10:38:21,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:38:21,132 INFO L93 Difference]: Finished difference Result 202 states and 208 transitions. [2022-01-31 10:38:21,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-01-31 10:38:21,132 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.5625) internal successors, (123), 43 states have internal predecessors, (123), 31 states have call successors, (37), 6 states have call predecessors, (37), 4 states have return successors, (33), 31 states have call predecessors, (33), 29 states have call successors, (33) Word has length 137 [2022-01-31 10:38:21,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:38:21,133 INFO L225 Difference]: With dead ends: 202 [2022-01-31 10:38:21,133 INFO L226 Difference]: Without dead ends: 202 [2022-01-31 10:38:21,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 268 SyntacticMatches, 22 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2119 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=443, Invalid=5561, Unknown=2, NotChecked=0, Total=6006 [2022-01-31 10:38:21,134 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 112 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 2122 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 2506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 288 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 10:38:21,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 377 Invalid, 2506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2122 Invalid, 0 Unknown, 288 Unchecked, 0.8s Time] [2022-01-31 10:38:21,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-01-31 10:38:21,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 149. [2022-01-31 10:38:21,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 109 states have (on average 1.0275229357798166) internal successors, (112), 110 states have internal predecessors, (112), 21 states have call successors, (21), 19 states have call predecessors, (21), 18 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-01-31 10:38:21,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 153 transitions. [2022-01-31 10:38:21,137 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 153 transitions. Word has length 137 [2022-01-31 10:38:21,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:38:21,138 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 153 transitions. [2022-01-31 10:38:21,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.5625) internal successors, (123), 43 states have internal predecessors, (123), 31 states have call successors, (37), 6 states have call predecessors, (37), 4 states have return successors, (33), 31 states have call predecessors, (33), 29 states have call successors, (33) [2022-01-31 10:38:21,138 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 153 transitions. [2022-01-31 10:38:21,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-31 10:38:21,138 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:38:21,138 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:38:21,155 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-31 10:38:21,347 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-31 10:38:21,347 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:38:21,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:38:21,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1766719360, now seen corresponding path program 21 times [2022-01-31 10:38:21,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:38:21,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228029451] [2022-01-31 10:38:21,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:38:21,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:38:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:21,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:38:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:21,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:38:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:21,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:38:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:21,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:38:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:21,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:38:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:21,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:38:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:21,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:38:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:21,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:38:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:21,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:38:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:21,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:38:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:21,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:38:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:21,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-31 10:38:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:21,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 10:38:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:21,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-31 10:38:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:21,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-31 10:38:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:21,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-01-31 10:38:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:21,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-31 10:38:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:21,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-31 10:38:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:21,721 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 41 proven. 239 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2022-01-31 10:38:21,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:38:21,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228029451] [2022-01-31 10:38:21,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228029451] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:38:21,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234487450] [2022-01-31 10:38:21,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 10:38:21,721 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:38:21,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:38:21,722 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-31 10:38:21,723 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-31 10:38:21,864 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-01-31 10:38:21,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:38:21,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 52 conjunts are in the unsatisfiable core [2022-01-31 10:38:21,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:38:22,334 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:38:31,686 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-01-31 10:38:31,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-01-31 10:38:31,781 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 27 proven. 253 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2022-01-31 10:38:31,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:38:36,308 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 16 treesize of output 14 [2022-01-31 10:38:36,310 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 32 treesize of output 28 [2022-01-31 10:38:36,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234487450] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:38:36,410 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 10:38:36,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 52 [2022-01-31 10:38:36,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971830092] [2022-01-31 10:38:36,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 10:38:36,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-01-31 10:38:36,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:38:36,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-01-31 10:38:36,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=3767, Unknown=3, NotChecked=0, Total=4160 [2022-01-31 10:38:36,412 INFO L87 Difference]: Start difference. First operand 149 states and 153 transitions. Second operand has 52 states, 50 states have (on average 2.4) internal successors, (120), 45 states have internal predecessors, (120), 33 states have call successors, (37), 5 states have call predecessors, (37), 3 states have return successors, (34), 33 states have call predecessors, (34), 31 states have call successors, (34) [2022-01-31 10:38:37,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:38:37,258 INFO L93 Difference]: Finished difference Result 205 states and 210 transitions. [2022-01-31 10:38:37,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-31 10:38:37,263 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 2.4) internal successors, (120), 45 states have internal predecessors, (120), 33 states have call successors, (37), 5 states have call predecessors, (37), 3 states have return successors, (34), 33 states have call predecessors, (34), 31 states have call successors, (34) Word has length 145 [2022-01-31 10:38:37,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:38:37,263 INFO L225 Difference]: With dead ends: 205 [2022-01-31 10:38:37,263 INFO L226 Difference]: Without dead ends: 205 [2022-01-31 10:38:37,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 195 SyntacticMatches, 15 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2252 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=573, Invalid=6230, Unknown=3, NotChecked=0, Total=6806 [2022-01-31 10:38:37,265 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 100 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 1921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 447 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 10:38:37,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 454 Invalid, 1921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1405 Invalid, 0 Unknown, 447 Unchecked, 0.5s Time] [2022-01-31 10:38:37,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-01-31 10:38:37,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 157. [2022-01-31 10:38:37,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 115 states have (on average 1.0260869565217392) internal successors, (118), 116 states have internal predecessors, (118), 22 states have call successors, (22), 20 states have call predecessors, (22), 19 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-01-31 10:38:37,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 161 transitions. [2022-01-31 10:38:37,269 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 161 transitions. Word has length 145 [2022-01-31 10:38:37,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:38:37,269 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 161 transitions. [2022-01-31 10:38:37,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 2.4) internal successors, (120), 45 states have internal predecessors, (120), 33 states have call successors, (37), 5 states have call predecessors, (37), 3 states have return successors, (34), 33 states have call predecessors, (34), 31 states have call successors, (34) [2022-01-31 10:38:37,269 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 161 transitions. [2022-01-31 10:38:37,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-31 10:38:37,270 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:38:37,270 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 9, 9, 9, 9, 9, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:38:37,289 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-31 10:38:37,487 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-31 10:38:37,487 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:38:37,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:38:37,487 INFO L85 PathProgramCache]: Analyzing trace with hash -658065076, now seen corresponding path program 22 times [2022-01-31 10:38:37,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:38:37,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797870533] [2022-01-31 10:38:37,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:38:37,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:38:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:37,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:38:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:37,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:38:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:37,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:38:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:37,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:38:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:37,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:38:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:37,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:38:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:37,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:38:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:37,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:38:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:37,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:38:37,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:37,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:38:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:37,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:38:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:37,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:38:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:37,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 10:38:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:37,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-31 10:38:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:37,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-31 10:38:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:37,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-01-31 10:38:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:37,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-31 10:38:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:37,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-31 10:38:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:37,921 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 36 proven. 255 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2022-01-31 10:38:37,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:38:37,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797870533] [2022-01-31 10:38:37,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797870533] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:38:37,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721569269] [2022-01-31 10:38:37,922 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 10:38:37,922 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:38:37,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:38:37,923 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-31 10:38:37,934 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-31 10:38:38,038 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 10:38:38,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:38:38,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 51 conjunts are in the unsatisfiable core [2022-01-31 10:38:38,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:38:38,377 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:38:38,442 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:38:38,442 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:38:38,519 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:38:38,519 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:38:38,976 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:38:39,030 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 87 proven. 264 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2022-01-31 10:38:39,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:38:39,205 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 21 treesize of output 19 [2022-01-31 10:38:39,206 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 37 treesize of output 33 [2022-01-31 10:38:39,417 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 36 proven. 254 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2022-01-31 10:38:39,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721569269] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:38:39,417 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:38:39,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 27] total 52 [2022-01-31 10:38:39,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339147907] [2022-01-31 10:38:39,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:38:39,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-01-31 10:38:39,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:38:39,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-01-31 10:38:39,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2465, Unknown=0, NotChecked=0, Total=2652 [2022-01-31 10:38:39,419 INFO L87 Difference]: Start difference. First operand 157 states and 161 transitions. Second operand has 52 states, 49 states have (on average 2.5714285714285716) internal successors, (126), 44 states have internal predecessors, (126), 33 states have call successors, (40), 5 states have call predecessors, (40), 3 states have return successors, (36), 33 states have call predecessors, (36), 31 states have call successors, (36) [2022-01-31 10:38:40,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:38:40,338 INFO L93 Difference]: Finished difference Result 201 states and 210 transitions. [2022-01-31 10:38:40,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-01-31 10:38:40,359 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 49 states have (on average 2.5714285714285716) internal successors, (126), 44 states have internal predecessors, (126), 33 states have call successors, (40), 5 states have call predecessors, (40), 3 states have return successors, (36), 33 states have call predecessors, (36), 31 states have call successors, (36) Word has length 145 [2022-01-31 10:38:40,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:38:40,361 INFO L225 Difference]: With dead ends: 201 [2022-01-31 10:38:40,361 INFO L226 Difference]: Without dead ends: 201 [2022-01-31 10:38:40,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 281 SyntacticMatches, 25 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2276 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=444, Invalid=6036, Unknown=0, NotChecked=0, Total=6480 [2022-01-31 10:38:40,362 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 122 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 2243 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 2488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 10:38:40,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 269 Invalid, 2488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2243 Invalid, 0 Unknown, 141 Unchecked, 0.6s Time] [2022-01-31 10:38:40,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-01-31 10:38:40,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 179. [2022-01-31 10:38:40,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 131 states have (on average 1.0229007633587786) internal successors, (134), 133 states have internal predecessors, (134), 27 states have call successors, (27), 21 states have call predecessors, (27), 20 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-01-31 10:38:40,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 187 transitions. [2022-01-31 10:38:40,366 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 187 transitions. Word has length 145 [2022-01-31 10:38:40,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:38:40,367 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 187 transitions. [2022-01-31 10:38:40,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 49 states have (on average 2.5714285714285716) internal successors, (126), 44 states have internal predecessors, (126), 33 states have call successors, (40), 5 states have call predecessors, (40), 3 states have return successors, (36), 33 states have call predecessors, (36), 31 states have call successors, (36) [2022-01-31 10:38:40,367 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 187 transitions. [2022-01-31 10:38:40,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-01-31 10:38:40,368 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:38:40,368 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:38:40,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-01-31 10:38:40,585 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-31 10:38:40,586 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:38:40,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:38:40,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1230262418, now seen corresponding path program 23 times [2022-01-31 10:38:40,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:38:40,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268825357] [2022-01-31 10:38:40,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:38:40,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:38:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:40,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:38:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:40,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:38:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:40,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:38:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:40,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:38:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:40,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:38:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:40,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:38:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:40,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:38:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:40,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:38:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:40,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:38:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:40,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:38:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:40,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:38:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:40,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-31 10:38:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:40,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 10:38:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:40,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-31 10:38:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:40,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-31 10:38:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:40,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-01-31 10:38:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:40,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-31 10:38:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:40,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-31 10:38:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:40,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-31 10:38:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:40,788 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 115 proven. 149 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2022-01-31 10:38:40,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:38:40,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268825357] [2022-01-31 10:38:40,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268825357] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:38:40,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469773822] [2022-01-31 10:38:40,789 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 10:38:40,789 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:38:40,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:38:40,804 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-31 10:38:40,804 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-31 10:38:40,905 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-01-31 10:38:40,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:38:40,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-31 10:38:40,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:38:41,307 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 144 proven. 120 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2022-01-31 10:38:41,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:38:41,541 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 144 proven. 120 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2022-01-31 10:38:41,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469773822] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:38:41,541 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:38:41,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 33 [2022-01-31 10:38:41,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132342171] [2022-01-31 10:38:41,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:38:41,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-31 10:38:41,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:38:41,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-31 10:38:41,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=809, Unknown=0, NotChecked=0, Total=1056 [2022-01-31 10:38:41,542 INFO L87 Difference]: Start difference. First operand 179 states and 187 transitions. Second operand has 33 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 32 states have internal predecessors, (100), 28 states have call successors, (32), 3 states have call predecessors, (32), 1 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-01-31 10:38:41,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:38:41,991 INFO L93 Difference]: Finished difference Result 203 states and 215 transitions. [2022-01-31 10:38:41,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 10:38:41,992 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 32 states have internal predecessors, (100), 28 states have call successors, (32), 3 states have call predecessors, (32), 1 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) Word has length 153 [2022-01-31 10:38:41,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:38:41,992 INFO L225 Difference]: With dead ends: 203 [2022-01-31 10:38:41,992 INFO L226 Difference]: Without dead ends: 161 [2022-01-31 10:38:41,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 332 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=604, Invalid=2152, Unknown=0, NotChecked=0, Total=2756 [2022-01-31 10:38:41,993 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 141 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 10:38:41,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 78 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 10:38:41,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-01-31 10:38:41,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2022-01-31 10:38:41,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 109 states have internal predecessors, (110), 21 states have call successors, (21), 19 states have call predecessors, (21), 18 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-01-31 10:38:41,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 151 transitions. [2022-01-31 10:38:41,996 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 151 transitions. Word has length 153 [2022-01-31 10:38:41,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:38:41,996 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 151 transitions. [2022-01-31 10:38:41,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 32 states have internal predecessors, (100), 28 states have call successors, (32), 3 states have call predecessors, (32), 1 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-01-31 10:38:41,996 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 151 transitions. [2022-01-31 10:38:41,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-01-31 10:38:41,997 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:38:41,997 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:38:42,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-01-31 10:38:42,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-01-31 10:38:42,207 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:38:42,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:38:42,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1535934046, now seen corresponding path program 24 times [2022-01-31 10:38:42,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:38:42,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268382275] [2022-01-31 10:38:42,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:38:42,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:38:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:42,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:38:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:42,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:38:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:42,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:38:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:42,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:38:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:42,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:38:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:42,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:38:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:42,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:38:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:42,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:38:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:42,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:38:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:42,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:38:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:42,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:38:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:42,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:38:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:42,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 10:38:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:42,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-31 10:38:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:42,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-31 10:38:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:42,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-01-31 10:38:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:42,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-31 10:38:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:42,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-31 10:38:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:42,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-31 10:38:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 41 proven. 278 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2022-01-31 10:38:42,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:38:42,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268382275] [2022-01-31 10:38:42,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268382275] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:38:42,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613708146] [2022-01-31 10:38:42,601 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 10:38:42,601 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:38:42,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:38:42,602 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:38:42,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-01-31 10:38:42,744 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-01-31 10:38:42,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:38:42,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 52 conjunts are in the unsatisfiable core [2022-01-31 10:38:42,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:38:43,212 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:38:43,393 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-31 10:38:43,394 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-31 10:38:44,358 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:38:44,452 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 61 proven. 292 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2022-01-31 10:38:44,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:38:44,661 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 21 treesize of output 19 [2022-01-31 10:38:44,662 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 37 treesize of output 33 [2022-01-31 10:38:44,968 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 41 proven. 278 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2022-01-31 10:38:44,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613708146] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:38:44,969 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:38:44,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 53 [2022-01-31 10:38:44,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114452697] [2022-01-31 10:38:44,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:38:44,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-01-31 10:38:44,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:38:44,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-01-31 10:38:44,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2569, Unknown=0, NotChecked=0, Total=2756 [2022-01-31 10:38:44,970 INFO L87 Difference]: Start difference. First operand 148 states and 151 transitions. Second operand has 53 states, 51 states have (on average 2.588235294117647) internal successors, (132), 46 states have internal predecessors, (132), 35 states have call successors, (41), 5 states have call predecessors, (41), 3 states have return successors, (37), 35 states have call predecessors, (37), 33 states have call successors, (37) [2022-01-31 10:38:46,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:38:46,408 INFO L93 Difference]: Finished difference Result 226 states and 232 transitions. [2022-01-31 10:38:46,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-01-31 10:38:46,408 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 2.588235294117647) internal successors, (132), 46 states have internal predecessors, (132), 35 states have call successors, (41), 5 states have call predecessors, (41), 3 states have return successors, (37), 35 states have call predecessors, (37), 33 states have call successors, (37) Word has length 153 [2022-01-31 10:38:46,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:38:46,409 INFO L225 Difference]: With dead ends: 226 [2022-01-31 10:38:46,409 INFO L226 Difference]: Without dead ends: 226 [2022-01-31 10:38:46,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 298 SyntacticMatches, 24 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2455 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=454, Invalid=6518, Unknown=0, NotChecked=0, Total=6972 [2022-01-31 10:38:46,410 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 97 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 2774 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 3019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 10:38:46,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 429 Invalid, 3019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2774 Invalid, 0 Unknown, 164 Unchecked, 0.9s Time] [2022-01-31 10:38:46,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-01-31 10:38:46,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 165. [2022-01-31 10:38:46,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 121 states have (on average 1.024793388429752) internal successors, (124), 122 states have internal predecessors, (124), 23 states have call successors, (23), 21 states have call predecessors, (23), 20 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-01-31 10:38:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2022-01-31 10:38:46,413 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 169 transitions. Word has length 153 [2022-01-31 10:38:46,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:38:46,413 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 169 transitions. [2022-01-31 10:38:46,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 2.588235294117647) internal successors, (132), 46 states have internal predecessors, (132), 35 states have call successors, (41), 5 states have call predecessors, (41), 3 states have return successors, (37), 35 states have call predecessors, (37), 33 states have call successors, (37) [2022-01-31 10:38:46,413 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2022-01-31 10:38:46,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-01-31 10:38:46,414 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:38:46,414 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:38:46,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-01-31 10:38:46,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-01-31 10:38:46,623 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:38:46,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:38:46,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1603080560, now seen corresponding path program 25 times [2022-01-31 10:38:46,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:38:46,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173932571] [2022-01-31 10:38:46,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:38:46,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:38:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:46,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:38:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:46,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:38:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:46,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:38:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:47,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:38:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:47,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:38:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:47,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:38:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:47,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:38:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:47,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:38:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:47,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:38:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:47,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:38:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:47,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:38:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:47,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:38:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:47,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 10:38:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:47,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-31 10:38:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:47,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-31 10:38:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:47,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-01-31 10:38:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:47,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-31 10:38:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:47,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-31 10:38:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:47,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-31 10:38:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:47,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:38:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 46 proven. 305 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2022-01-31 10:38:47,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:38:47,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173932571] [2022-01-31 10:38:47,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173932571] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:38:47,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563322327] [2022-01-31 10:38:47,093 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 10:38:47,093 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:38:47,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:38:47,121 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:38:47,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-01-31 10:38:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:47,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 53 conjunts are in the unsatisfiable core [2022-01-31 10:38:47,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:38:47,645 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 13 treesize of output 9 [2022-01-31 10:38:48,231 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:38:48,295 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 30 proven. 321 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2022-01-31 10:38:48,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:38:48,407 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 16 treesize of output 14 [2022-01-31 10:38:48,409 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 32 treesize of output 28 [2022-01-31 10:38:48,604 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 46 proven. 305 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2022-01-31 10:38:48,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563322327] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:38:48,604 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:38:48,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 28] total 54 [2022-01-31 10:38:48,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270964182] [2022-01-31 10:38:48,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:38:48,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-01-31 10:38:48,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:38:48,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-01-31 10:38:48,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2682, Unknown=0, NotChecked=0, Total=2862 [2022-01-31 10:38:48,605 INFO L87 Difference]: Start difference. First operand 165 states and 169 transitions. Second operand has 54 states, 52 states have (on average 2.5961538461538463) internal successors, (135), 47 states have internal predecessors, (135), 37 states have call successors, (43), 5 states have call predecessors, (43), 3 states have return successors, (39), 37 states have call predecessors, (39), 35 states have call successors, (39) [2022-01-31 10:38:50,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:38:50,005 INFO L93 Difference]: Finished difference Result 245 states and 253 transitions. [2022-01-31 10:38:50,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-31 10:38:50,006 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 2.5961538461538463) internal successors, (135), 47 states have internal predecessors, (135), 37 states have call successors, (43), 5 states have call predecessors, (43), 3 states have return successors, (39), 37 states have call predecessors, (39), 35 states have call successors, (39) Word has length 161 [2022-01-31 10:38:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:38:50,007 INFO L225 Difference]: With dead ends: 245 [2022-01-31 10:38:50,007 INFO L226 Difference]: Without dead ends: 245 [2022-01-31 10:38:50,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 318 SyntacticMatches, 21 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2350 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=443, Invalid=6529, Unknown=0, NotChecked=0, Total=6972 [2022-01-31 10:38:50,008 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 194 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 4555 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 4949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 4555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 210 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 10:38:50,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 455 Invalid, 4949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 4555 Invalid, 0 Unknown, 210 Unchecked, 1.1s Time] [2022-01-31 10:38:50,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-01-31 10:38:50,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 173. [2022-01-31 10:38:50,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 127 states have (on average 1.0236220472440944) internal successors, (130), 128 states have internal predecessors, (130), 24 states have call successors, (24), 22 states have call predecessors, (24), 21 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-01-31 10:38:50,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 177 transitions. [2022-01-31 10:38:50,025 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 177 transitions. Word has length 161 [2022-01-31 10:38:50,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:38:50,026 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 177 transitions. [2022-01-31 10:38:50,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 2.5961538461538463) internal successors, (135), 47 states have internal predecessors, (135), 37 states have call successors, (43), 5 states have call predecessors, (43), 3 states have return successors, (39), 37 states have call predecessors, (39), 35 states have call successors, (39) [2022-01-31 10:38:50,026 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 177 transitions. [2022-01-31 10:38:50,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-01-31 10:38:50,026 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:38:50,026 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 10, 10, 10, 10, 10, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:38:50,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-01-31 10:38:50,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-01-31 10:38:50,227 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:38:50,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:38:50,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1908752188, now seen corresponding path program 26 times [2022-01-31 10:38:50,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:38:50,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019845440] [2022-01-31 10:38:50,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:38:50,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:38:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:50,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:38:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:50,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:38:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:50,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:38:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:50,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:38:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:50,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:38:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:50,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:38:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:50,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:38:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:50,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:38:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:50,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:38:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:50,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:38:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:50,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:38:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:50,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:38:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:50,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:38:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:50,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-31 10:38:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:50,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-31 10:38:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:50,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-01-31 10:38:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:50,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-31 10:38:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:50,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-31 10:38:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:50,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-31 10:38:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:50,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:38:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:50,713 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 41 proven. 321 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-01-31 10:38:50,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:38:50,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019845440] [2022-01-31 10:38:50,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019845440] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:38:50,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884283997] [2022-01-31 10:38:50,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 10:38:50,714 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:38:50,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:38:50,732 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:38:50,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-01-31 10:38:50,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 10:38:50,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:38:50,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 55 conjunts are in the unsatisfiable core [2022-01-31 10:38:50,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:38:51,254 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:38:51,323 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:38:51,324 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:38:51,402 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:38:51,402 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:38:51,941 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:38:52,001 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 98 proven. 332 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-01-31 10:38:52,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:38:52,180 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 21 treesize of output 19 [2022-01-31 10:38:52,181 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 37 treesize of output 33 [2022-01-31 10:38:52,381 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 41 proven. 320 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-01-31 10:38:52,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884283997] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:38:52,381 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:38:52,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 54 [2022-01-31 10:38:52,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527704834] [2022-01-31 10:38:52,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:38:52,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-01-31 10:38:52,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:38:52,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-01-31 10:38:52,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2668, Unknown=0, NotChecked=0, Total=2862 [2022-01-31 10:38:52,383 INFO L87 Difference]: Start difference. First operand 173 states and 177 transitions. Second operand has 54 states, 52 states have (on average 2.6346153846153846) internal successors, (137), 47 states have internal predecessors, (137), 36 states have call successors, (43), 5 states have call predecessors, (43), 3 states have return successors, (39), 36 states have call predecessors, (39), 34 states have call successors, (39) [2022-01-31 10:38:53,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:38:53,861 INFO L93 Difference]: Finished difference Result 217 states and 226 transitions. [2022-01-31 10:38:53,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-01-31 10:38:53,861 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 2.6346153846153846) internal successors, (137), 47 states have internal predecessors, (137), 36 states have call successors, (43), 5 states have call predecessors, (43), 3 states have return successors, (39), 36 states have call predecessors, (39), 34 states have call successors, (39) Word has length 161 [2022-01-31 10:38:53,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:38:53,862 INFO L225 Difference]: With dead ends: 217 [2022-01-31 10:38:53,862 INFO L226 Difference]: Without dead ends: 217 [2022-01-31 10:38:53,863 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 321 SyntacticMatches, 27 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2515 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=458, Invalid=6514, Unknown=0, NotChecked=0, Total=6972 [2022-01-31 10:38:53,863 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 145 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 2928 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 3257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 238 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 10:38:53,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 399 Invalid, 3257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2928 Invalid, 0 Unknown, 238 Unchecked, 1.0s Time] [2022-01-31 10:38:53,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-01-31 10:38:53,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 199. [2022-01-31 10:38:53,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 146 states have (on average 1.0205479452054795) internal successors, (149), 148 states have internal predecessors, (149), 30 states have call successors, (30), 23 states have call predecessors, (30), 22 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2022-01-31 10:38:53,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 208 transitions. [2022-01-31 10:38:53,867 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 208 transitions. Word has length 161 [2022-01-31 10:38:53,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:38:53,867 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 208 transitions. [2022-01-31 10:38:53,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 2.6346153846153846) internal successors, (137), 47 states have internal predecessors, (137), 36 states have call successors, (43), 5 states have call predecessors, (43), 3 states have return successors, (39), 36 states have call predecessors, (39), 34 states have call successors, (39) [2022-01-31 10:38:53,867 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 208 transitions. [2022-01-31 10:38:53,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-01-31 10:38:53,868 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:38:53,868 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:38:53,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-01-31 10:38:54,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:38:54,076 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:38:54,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:38:54,076 INFO L85 PathProgramCache]: Analyzing trace with hash 471495298, now seen corresponding path program 27 times [2022-01-31 10:38:54,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:38:54,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088336271] [2022-01-31 10:38:54,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:38:54,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:38:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:54,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:38:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:54,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:38:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:54,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:38:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:54,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:38:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:54,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:38:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:54,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:38:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:54,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:38:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:54,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:38:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:54,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:38:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:54,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:38:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:54,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:38:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:54,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:38:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:54,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 10:38:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:54,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-31 10:38:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:54,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-31 10:38:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:54,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-01-31 10:38:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:54,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-31 10:38:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:54,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-31 10:38:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:54,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-31 10:38:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:54,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:38:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:54,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:38:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:54,305 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 147 proven. 186 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-01-31 10:38:54,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:38:54,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088336271] [2022-01-31 10:38:54,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088336271] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:38:54,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313268163] [2022-01-31 10:38:54,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 10:38:54,306 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:38:54,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:38:54,320 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:38:54,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-01-31 10:38:54,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-01-31 10:38:54,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:38:54,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 22 conjunts are in the unsatisfiable core [2022-01-31 10:38:54,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:38:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 180 proven. 153 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-01-31 10:38:54,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:38:54,950 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 180 proven. 153 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-01-31 10:38:54,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313268163] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:38:54,950 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:38:54,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 36 [2022-01-31 10:38:54,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669394914] [2022-01-31 10:38:54,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:38:54,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-31 10:38:54,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:38:54,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-31 10:38:54,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=967, Unknown=0, NotChecked=0, Total=1260 [2022-01-31 10:38:54,951 INFO L87 Difference]: Start difference. First operand 199 states and 208 transitions. Second operand has 36 states, 36 states have (on average 3.0277777777777777) internal successors, (109), 35 states have internal predecessors, (109), 31 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 30 states have call predecessors, (32), 30 states have call successors, (32) [2022-01-31 10:38:55,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:38:55,328 INFO L93 Difference]: Finished difference Result 223 states and 236 transitions. [2022-01-31 10:38:55,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-31 10:38:55,328 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.0277777777777777) internal successors, (109), 35 states have internal predecessors, (109), 31 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 30 states have call predecessors, (32), 30 states have call successors, (32) Word has length 169 [2022-01-31 10:38:55,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:38:55,329 INFO L225 Difference]: With dead ends: 223 [2022-01-31 10:38:55,329 INFO L226 Difference]: Without dead ends: 177 [2022-01-31 10:38:55,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 367 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=718, Invalid=2588, Unknown=0, NotChecked=0, Total=3306 [2022-01-31 10:38:55,330 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 154 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 10:38:55,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 100 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 10:38:55,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-01-31 10:38:55,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 164. [2022-01-31 10:38:55,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 120 states have (on average 1.0166666666666666) internal successors, (122), 121 states have internal predecessors, (122), 23 states have call successors, (23), 21 states have call predecessors, (23), 20 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-01-31 10:38:55,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 167 transitions. [2022-01-31 10:38:55,332 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 167 transitions. Word has length 169 [2022-01-31 10:38:55,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:38:55,333 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 167 transitions. [2022-01-31 10:38:55,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.0277777777777777) internal successors, (109), 35 states have internal predecessors, (109), 31 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 30 states have call predecessors, (32), 30 states have call successors, (32) [2022-01-31 10:38:55,333 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 167 transitions. [2022-01-31 10:38:55,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-01-31 10:38:55,333 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:38:55,333 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:38:55,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-01-31 10:38:55,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:38:55,551 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:38:55,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:38:55,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1537338290, now seen corresponding path program 28 times [2022-01-31 10:38:55,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:38:55,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020781191] [2022-01-31 10:38:55,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:38:55,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:38:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:55,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:38:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:55,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:38:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:55,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:38:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:55,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:38:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:55,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:38:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:55,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:38:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:55,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:38:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:55,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:38:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:55,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:38:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:55,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:38:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:55,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:38:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:55,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:38:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:55,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:38:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:55,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-31 10:38:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:55,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-31 10:38:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:55,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-01-31 10:38:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:55,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-31 10:38:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:55,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-31 10:38:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:55,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-31 10:38:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:55,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:38:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:55,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:38:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:38:55,901 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 46 proven. 348 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-01-31 10:38:55,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:38:55,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020781191] [2022-01-31 10:38:55,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020781191] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:38:55,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024952417] [2022-01-31 10:38:55,901 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 10:38:55,901 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:38:55,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:38:55,902 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:38:55,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-01-31 10:38:56,020 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 10:38:56,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:38:56,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 56 conjunts are in the unsatisfiable core [2022-01-31 10:38:56,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:38:56,559 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:39:00,727 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-31 10:39:00,727 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 27 treesize of output 26 [2022-01-31 10:39:01,863 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:39:01,959 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 68 proven. 364 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2022-01-31 10:39:01,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:39:02,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 21 treesize of output 19 [2022-01-31 10:39:02,195 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 37 treesize of output 33 [2022-01-31 10:39:02,453 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 46 proven. 348 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-01-31 10:39:02,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024952417] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:39:02,453 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:39:02,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 57 [2022-01-31 10:39:02,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616357688] [2022-01-31 10:39:02,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:39:02,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-01-31 10:39:02,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:39:02,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-01-31 10:39:02,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2987, Unknown=2, NotChecked=0, Total=3192 [2022-01-31 10:39:02,454 INFO L87 Difference]: Start difference. First operand 164 states and 167 transitions. Second operand has 57 states, 55 states have (on average 2.618181818181818) internal successors, (144), 50 states have internal predecessors, (144), 39 states have call successors, (45), 5 states have call predecessors, (45), 3 states have return successors, (41), 39 states have call predecessors, (41), 37 states have call successors, (41) [2022-01-31 10:39:03,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:39:03,655 INFO L93 Difference]: Finished difference Result 252 states and 259 transitions. [2022-01-31 10:39:03,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-31 10:39:03,655 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 55 states have (on average 2.618181818181818) internal successors, (144), 50 states have internal predecessors, (144), 39 states have call successors, (45), 5 states have call predecessors, (45), 3 states have return successors, (41), 39 states have call predecessors, (41), 37 states have call successors, (41) Word has length 169 [2022-01-31 10:39:03,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:39:03,656 INFO L225 Difference]: With dead ends: 252 [2022-01-31 10:39:03,656 INFO L226 Difference]: Without dead ends: 252 [2022-01-31 10:39:03,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 331 SyntacticMatches, 25 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2750 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=489, Invalid=7341, Unknown=2, NotChecked=0, Total=7832 [2022-01-31 10:39:03,658 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 122 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 2894 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 3157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 2894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 10:39:03,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 425 Invalid, 3157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 2894 Invalid, 0 Unknown, 160 Unchecked, 0.8s Time] [2022-01-31 10:39:03,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-01-31 10:39:03,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 181. [2022-01-31 10:39:03,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 133 states have (on average 1.0225563909774436) internal successors, (136), 134 states have internal predecessors, (136), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-01-31 10:39:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 185 transitions. [2022-01-31 10:39:03,684 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 185 transitions. Word has length 169 [2022-01-31 10:39:03,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:39:03,684 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 185 transitions. [2022-01-31 10:39:03,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 55 states have (on average 2.618181818181818) internal successors, (144), 50 states have internal predecessors, (144), 39 states have call successors, (45), 5 states have call predecessors, (45), 3 states have return successors, (41), 39 states have call predecessors, (41), 37 states have call successors, (41) [2022-01-31 10:39:03,684 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 185 transitions. [2022-01-31 10:39:03,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-01-31 10:39:03,685 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:39:03,685 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:39:03,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-01-31 10:39:03,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-01-31 10:39:03,885 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:39:03,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:39:03,886 INFO L85 PathProgramCache]: Analyzing trace with hash 471971680, now seen corresponding path program 29 times [2022-01-31 10:39:03,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:39:03,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604224119] [2022-01-31 10:39:03,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:39:03,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:39:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:04,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:39:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:04,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:39:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:04,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:39:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:04,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:39:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:04,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:39:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:04,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:39:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:04,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:39:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:04,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:39:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:04,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:39:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:04,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:39:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:04,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:39:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:04,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:39:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:04,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:39:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:04,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-31 10:39:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:04,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-31 10:39:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:04,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-01-31 10:39:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:04,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-31 10:39:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:04,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-31 10:39:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:04,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-31 10:39:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:04,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:39:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:04,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:39:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:04,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:39:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:04,321 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 51 proven. 379 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2022-01-31 10:39:04,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:39:04,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604224119] [2022-01-31 10:39:04,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604224119] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:39:04,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533227329] [2022-01-31 10:39:04,321 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 10:39:04,322 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:39:04,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:39:04,323 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:39:04,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-01-31 10:39:04,447 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-01-31 10:39:04,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:39:04,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 57 conjunts are in the unsatisfiable core [2022-01-31 10:39:04,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:39:05,075 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 13 treesize of output 9 [2022-01-31 10:39:06,080 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:39:06,150 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 33 proven. 397 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2022-01-31 10:39:06,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:39:06,275 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 16 treesize of output 14 [2022-01-31 10:39:06,277 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 32 treesize of output 28 [2022-01-31 10:39:06,484 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 51 proven. 379 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2022-01-31 10:39:06,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533227329] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:39:06,484 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:39:06,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 30] total 58 [2022-01-31 10:39:06,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352889583] [2022-01-31 10:39:06,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:39:06,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-01-31 10:39:06,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:39:06,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-01-31 10:39:06,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=3111, Unknown=0, NotChecked=0, Total=3306 [2022-01-31 10:39:06,485 INFO L87 Difference]: Start difference. First operand 181 states and 185 transitions. Second operand has 58 states, 56 states have (on average 2.625) internal successors, (147), 51 states have internal predecessors, (147), 41 states have call successors, (47), 5 states have call predecessors, (47), 3 states have return successors, (43), 41 states have call predecessors, (43), 39 states have call successors, (43) [2022-01-31 10:39:08,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:39:08,314 INFO L93 Difference]: Finished difference Result 269 states and 277 transitions. [2022-01-31 10:39:08,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-01-31 10:39:08,315 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 56 states have (on average 2.625) internal successors, (147), 51 states have internal predecessors, (147), 41 states have call successors, (47), 5 states have call predecessors, (47), 3 states have return successors, (43), 41 states have call predecessors, (43), 39 states have call successors, (43) Word has length 177 [2022-01-31 10:39:08,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:39:08,315 INFO L225 Difference]: With dead ends: 269 [2022-01-31 10:39:08,316 INFO L226 Difference]: Without dead ends: 269 [2022-01-31 10:39:08,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 350 SyntacticMatches, 23 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2824 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=480, Invalid=7710, Unknown=0, NotChecked=0, Total=8190 [2022-01-31 10:39:08,316 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 241 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 4586 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 5006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 4586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-31 10:39:08,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 349 Invalid, 5006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 4586 Invalid, 0 Unknown, 193 Unchecked, 1.4s Time] [2022-01-31 10:39:08,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-01-31 10:39:08,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 189. [2022-01-31 10:39:08,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 139 states have (on average 1.0215827338129497) internal successors, (142), 140 states have internal predecessors, (142), 26 states have call successors, (26), 24 states have call predecessors, (26), 23 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-01-31 10:39:08,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 193 transitions. [2022-01-31 10:39:08,320 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 193 transitions. Word has length 177 [2022-01-31 10:39:08,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:39:08,320 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 193 transitions. [2022-01-31 10:39:08,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 56 states have (on average 2.625) internal successors, (147), 51 states have internal predecessors, (147), 41 states have call successors, (47), 5 states have call predecessors, (47), 3 states have return successors, (43), 41 states have call predecessors, (43), 39 states have call successors, (43) [2022-01-31 10:39:08,320 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 193 transitions. [2022-01-31 10:39:08,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-01-31 10:39:08,321 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:39:08,321 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 11, 11, 11, 11, 11, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:39:08,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-01-31 10:39:08,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:39:08,531 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:39:08,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:39:08,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1536861908, now seen corresponding path program 30 times [2022-01-31 10:39:08,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:39:08,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520193021] [2022-01-31 10:39:08,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:39:08,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:39:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:08,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:39:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:08,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:39:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:08,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:39:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:08,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:39:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:08,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:39:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:08,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:39:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:08,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:39:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:08,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:39:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:08,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:39:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:08,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:39:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:08,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:39:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:08,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:39:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:08,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:39:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:08,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:39:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:08,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-31 10:39:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:08,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-01-31 10:39:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:08,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-31 10:39:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:08,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-31 10:39:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:08,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-31 10:39:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:08,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:39:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:08,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:39:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:08,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:39:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:08,981 INFO L134 CoverageAnalysis]: Checked inductivity of 799 backedges. 46 proven. 395 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2022-01-31 10:39:08,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:39:08,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520193021] [2022-01-31 10:39:08,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520193021] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:39:08,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540270905] [2022-01-31 10:39:08,981 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 10:39:08,981 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:39:08,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:39:08,982 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:39:08,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-01-31 10:39:09,224 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-01-31 10:39:09,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:39:09,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 59 conjunts are in the unsatisfiable core [2022-01-31 10:39:09,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:39:09,783 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:39:09,876 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:39:09,876 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:39:10,001 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:39:10,001 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:39:10,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:39:10,748 INFO L134 CoverageAnalysis]: Checked inductivity of 799 backedges. 109 proven. 408 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2022-01-31 10:39:10,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:39:11,067 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 21 treesize of output 19 [2022-01-31 10:39:11,069 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 37 treesize of output 33 [2022-01-31 10:39:11,396 INFO L134 CoverageAnalysis]: Checked inductivity of 799 backedges. 46 proven. 394 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2022-01-31 10:39:11,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540270905] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:39:11,396 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:39:11,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 58 [2022-01-31 10:39:11,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180106548] [2022-01-31 10:39:11,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:39:11,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-01-31 10:39:11,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:39:11,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-01-31 10:39:11,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=3096, Unknown=0, NotChecked=0, Total=3306 [2022-01-31 10:39:11,397 INFO L87 Difference]: Start difference. First operand 189 states and 193 transitions. Second operand has 58 states, 56 states have (on average 2.6607142857142856) internal successors, (149), 51 states have internal predecessors, (149), 40 states have call successors, (47), 5 states have call predecessors, (47), 3 states have return successors, (43), 40 states have call predecessors, (43), 38 states have call successors, (43) [2022-01-31 10:39:13,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:39:13,059 INFO L93 Difference]: Finished difference Result 241 states and 252 transitions. [2022-01-31 10:39:13,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-31 10:39:13,060 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 56 states have (on average 2.6607142857142856) internal successors, (149), 51 states have internal predecessors, (149), 40 states have call successors, (47), 5 states have call predecessors, (47), 3 states have return successors, (43), 40 states have call predecessors, (43), 38 states have call successors, (43) Word has length 177 [2022-01-31 10:39:13,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:39:13,061 INFO L225 Difference]: With dead ends: 241 [2022-01-31 10:39:13,061 INFO L226 Difference]: Without dead ends: 241 [2022-01-31 10:39:13,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 356 SyntacticMatches, 29 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3005 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=496, Invalid=7694, Unknown=0, NotChecked=0, Total=8190 [2022-01-31 10:39:13,061 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 151 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 3725 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 4062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 3725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 241 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-31 10:39:13,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 500 Invalid, 4062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 3725 Invalid, 0 Unknown, 241 Unchecked, 1.2s Time] [2022-01-31 10:39:13,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-01-31 10:39:13,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 219. [2022-01-31 10:39:13,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 161 states have (on average 1.0186335403726707) internal successors, (164), 163 states have internal predecessors, (164), 33 states have call successors, (33), 25 states have call predecessors, (33), 24 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2022-01-31 10:39:13,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 229 transitions. [2022-01-31 10:39:13,065 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 229 transitions. Word has length 177 [2022-01-31 10:39:13,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:39:13,065 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 229 transitions. [2022-01-31 10:39:13,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 56 states have (on average 2.6607142857142856) internal successors, (149), 51 states have internal predecessors, (149), 40 states have call successors, (47), 5 states have call predecessors, (47), 3 states have return successors, (43), 40 states have call predecessors, (43), 38 states have call successors, (43) [2022-01-31 10:39:13,065 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 229 transitions. [2022-01-31 10:39:13,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-01-31 10:39:13,066 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:39:13,066 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:39:13,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-01-31 10:39:13,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:39:13,276 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:39:13,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:39:13,276 INFO L85 PathProgramCache]: Analyzing trace with hash 543303794, now seen corresponding path program 31 times [2022-01-31 10:39:13,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:39:13,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588298651] [2022-01-31 10:39:13,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:39:13,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:39:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:13,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:39:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:13,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:39:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:13,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:39:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:13,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:39:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:13,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:39:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:13,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:39:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:13,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:39:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:13,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:39:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:13,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:39:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:13,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:39:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:13,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:39:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:13,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:39:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:13,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:39:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:13,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-31 10:39:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:13,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-31 10:39:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:13,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-01-31 10:39:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:13,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-31 10:39:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:13,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-31 10:39:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:13,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-31 10:39:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:13,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:39:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:13,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:39:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:13,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:39:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:13,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:39:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:13,493 INFO L134 CoverageAnalysis]: Checked inductivity of 854 backedges. 183 proven. 227 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2022-01-31 10:39:13,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:39:13,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588298651] [2022-01-31 10:39:13,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588298651] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:39:13,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800299461] [2022-01-31 10:39:13,493 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 10:39:13,493 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:39:13,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:39:13,494 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:39:13,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-01-31 10:39:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:13,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-31 10:39:13,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:39:14,102 INFO L134 CoverageAnalysis]: Checked inductivity of 854 backedges. 220 proven. 190 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2022-01-31 10:39:14,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:39:14,265 INFO L134 CoverageAnalysis]: Checked inductivity of 854 backedges. 220 proven. 190 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2022-01-31 10:39:14,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800299461] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:39:14,266 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:39:14,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 39 [2022-01-31 10:39:14,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177751815] [2022-01-31 10:39:14,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:39:14,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-01-31 10:39:14,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:39:14,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-01-31 10:39:14,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=1139, Unknown=0, NotChecked=0, Total=1482 [2022-01-31 10:39:14,267 INFO L87 Difference]: Start difference. First operand 219 states and 229 transitions. Second operand has 39 states, 39 states have (on average 3.0256410256410255) internal successors, (118), 38 states have internal predecessors, (118), 34 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (35), 33 states have call predecessors, (35), 33 states have call successors, (35) [2022-01-31 10:39:14,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:39:14,692 INFO L93 Difference]: Finished difference Result 243 states and 257 transitions. [2022-01-31 10:39:14,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 10:39:14,693 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.0256410256410255) internal successors, (118), 38 states have internal predecessors, (118), 34 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (35), 33 states have call predecessors, (35), 33 states have call successors, (35) Word has length 185 [2022-01-31 10:39:14,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:39:14,693 INFO L225 Difference]: With dead ends: 243 [2022-01-31 10:39:14,693 INFO L226 Difference]: Without dead ends: 193 [2022-01-31 10:39:14,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 402 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=842, Invalid=3064, Unknown=0, NotChecked=0, Total=3906 [2022-01-31 10:39:14,696 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 183 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 10:39:14,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 77 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 10:39:14,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-01-31 10:39:14,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 180. [2022-01-31 10:39:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 132 states have (on average 1.0151515151515151) internal successors, (134), 133 states have internal predecessors, (134), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-01-31 10:39:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 183 transitions. [2022-01-31 10:39:14,698 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 183 transitions. Word has length 185 [2022-01-31 10:39:14,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:39:14,698 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 183 transitions. [2022-01-31 10:39:14,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.0256410256410255) internal successors, (118), 38 states have internal predecessors, (118), 34 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (35), 33 states have call predecessors, (35), 33 states have call successors, (35) [2022-01-31 10:39:14,699 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 183 transitions. [2022-01-31 10:39:14,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-01-31 10:39:14,699 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:39:14,699 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:39:14,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-01-31 10:39:14,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-01-31 10:39:14,914 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:39:14,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:39:14,915 INFO L85 PathProgramCache]: Analyzing trace with hash -436388290, now seen corresponding path program 32 times [2022-01-31 10:39:14,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:39:14,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724907774] [2022-01-31 10:39:14,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:39:14,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:39:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:15,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:39:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:15,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:39:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:15,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:39:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:15,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:39:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:15,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:39:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:15,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:39:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:15,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:39:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:15,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:39:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:15,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:39:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:15,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:39:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:15,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:39:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:15,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:39:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:15,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:39:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:15,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:39:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:15,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-31 10:39:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:15,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-01-31 10:39:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:15,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-31 10:39:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:15,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-31 10:39:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:15,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-31 10:39:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:15,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:39:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:15,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:39:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:15,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:39:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:15,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:39:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:15,470 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 51 proven. 426 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2022-01-31 10:39:15,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:39:15,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724907774] [2022-01-31 10:39:15,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724907774] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:39:15,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314562594] [2022-01-31 10:39:15,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 10:39:15,471 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:39:15,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:39:15,472 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:39:15,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-01-31 10:39:15,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 10:39:15,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:39:15,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 60 conjunts are in the unsatisfiable core [2022-01-31 10:39:15,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:39:15,951 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:39:16,095 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-31 10:39:16,095 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-31 10:39:17,050 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:39:17,117 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 75 proven. 444 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2022-01-31 10:39:17,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:39:17,273 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 21 treesize of output 19 [2022-01-31 10:39:17,275 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 37 treesize of output 33 [2022-01-31 10:39:17,514 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 51 proven. 426 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2022-01-31 10:39:17,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314562594] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:39:17,514 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:39:17,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 61 [2022-01-31 10:39:17,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351280415] [2022-01-31 10:39:17,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:39:17,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-01-31 10:39:17,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:39:17,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-01-31 10:39:17,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3441, Unknown=0, NotChecked=0, Total=3660 [2022-01-31 10:39:17,521 INFO L87 Difference]: Start difference. First operand 180 states and 183 transitions. Second operand has 61 states, 59 states have (on average 2.6440677966101696) internal successors, (156), 54 states have internal predecessors, (156), 43 states have call successors, (49), 5 states have call predecessors, (49), 3 states have return successors, (45), 43 states have call predecessors, (45), 41 states have call successors, (45) [2022-01-31 10:39:18,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:39:18,620 INFO L93 Difference]: Finished difference Result 269 states and 273 transitions. [2022-01-31 10:39:18,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-31 10:39:18,621 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 59 states have (on average 2.6440677966101696) internal successors, (156), 54 states have internal predecessors, (156), 43 states have call successors, (49), 5 states have call predecessors, (49), 3 states have return successors, (45), 43 states have call predecessors, (45), 41 states have call successors, (45) Word has length 185 [2022-01-31 10:39:18,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:39:18,621 INFO L225 Difference]: With dead ends: 269 [2022-01-31 10:39:18,622 INFO L226 Difference]: Without dead ends: 269 [2022-01-31 10:39:18,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 371 SyntacticMatches, 27 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3194 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=511, Invalid=8419, Unknown=0, NotChecked=0, Total=8930 [2022-01-31 10:39:18,622 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 122 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 3082 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 3387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 3082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 226 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 10:39:18,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 493 Invalid, 3387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 3082 Invalid, 0 Unknown, 226 Unchecked, 0.7s Time] [2022-01-31 10:39:18,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-01-31 10:39:18,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 197. [2022-01-31 10:39:18,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 145 states have (on average 1.0206896551724138) internal successors, (148), 146 states have internal predecessors, (148), 27 states have call successors, (27), 25 states have call predecessors, (27), 24 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-01-31 10:39:18,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 201 transitions. [2022-01-31 10:39:18,661 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 201 transitions. Word has length 185 [2022-01-31 10:39:18,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:39:18,662 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 201 transitions. [2022-01-31 10:39:18,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 59 states have (on average 2.6440677966101696) internal successors, (156), 54 states have internal predecessors, (156), 43 states have call successors, (49), 5 states have call predecessors, (49), 3 states have return successors, (45), 43 states have call predecessors, (45), 41 states have call successors, (45) [2022-01-31 10:39:18,662 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 201 transitions. [2022-01-31 10:39:18,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-01-31 10:39:18,662 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:39:18,662 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:39:18,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-01-31 10:39:18,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-01-31 10:39:18,863 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:39:18,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:39:18,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1152381264, now seen corresponding path program 33 times [2022-01-31 10:39:18,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:39:18,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781996532] [2022-01-31 10:39:18,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:39:18,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:39:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:19,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:39:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:19,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:39:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:19,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:39:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:19,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:39:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:19,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:39:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:19,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:39:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:19,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:39:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:19,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:39:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:19,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:39:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:19,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:39:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:19,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:39:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:19,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:39:19,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:19,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:39:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:19,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:39:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:19,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-31 10:39:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:19,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-01-31 10:39:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:19,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-31 10:39:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:19,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-31 10:39:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:19,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-31 10:39:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:19,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:39:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:19,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:39:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:19,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:39:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:19,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:39:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:19,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:39:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 56 proven. 461 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2022-01-31 10:39:19,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:39:19,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781996532] [2022-01-31 10:39:19,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781996532] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:39:19,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761188426] [2022-01-31 10:39:19,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 10:39:19,285 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:39:19,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:39:19,286 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:39:19,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-01-31 10:39:19,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2022-01-31 10:39:19,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:39:19,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 64 conjunts are in the unsatisfiable core [2022-01-31 10:39:19,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:39:20,020 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:39:36,152 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-01-31 10:39:36,153 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-01-31 10:39:36,252 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 36 proven. 481 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2022-01-31 10:39:36,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:39:39,049 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 16 treesize of output 14 [2022-01-31 10:39:39,055 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 32 treesize of output 28 [2022-01-31 10:39:39,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761188426] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:39:39,134 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 10:39:39,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 65 [2022-01-31 10:39:39,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776108314] [2022-01-31 10:39:39,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 10:39:39,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-01-31 10:39:39,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:39:39,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-01-31 10:39:39,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=524, Invalid=5954, Unknown=2, NotChecked=0, Total=6480 [2022-01-31 10:39:39,151 INFO L87 Difference]: Start difference. First operand 197 states and 201 transitions. Second operand has 65 states, 62 states have (on average 2.5161290322580645) internal successors, (156), 58 states have internal predecessors, (156), 45 states have call successors, (49), 5 states have call predecessors, (49), 3 states have return successors, (46), 45 states have call predecessors, (46), 43 states have call successors, (46) [2022-01-31 10:39:40,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:39:40,170 INFO L93 Difference]: Finished difference Result 277 states and 282 transitions. [2022-01-31 10:39:40,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-31 10:39:40,171 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 62 states have (on average 2.5161290322580645) internal successors, (156), 58 states have internal predecessors, (156), 45 states have call successors, (49), 5 states have call predecessors, (49), 3 states have return successors, (46), 45 states have call predecessors, (46), 43 states have call successors, (46) Word has length 193 [2022-01-31 10:39:40,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:39:40,175 INFO L225 Difference]: With dead ends: 277 [2022-01-31 10:39:40,175 INFO L226 Difference]: Without dead ends: 277 [2022-01-31 10:39:40,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 265 SyntacticMatches, 21 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3554 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=741, Invalid=9357, Unknown=2, NotChecked=0, Total=10100 [2022-01-31 10:39:40,176 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 116 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 2178 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 2739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 2178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 472 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 10:39:40,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 690 Invalid, 2739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 2178 Invalid, 0 Unknown, 472 Unchecked, 0.6s Time] [2022-01-31 10:39:40,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-01-31 10:39:40,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 205. [2022-01-31 10:39:40,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 151 states have (on average 1.0198675496688743) internal successors, (154), 152 states have internal predecessors, (154), 28 states have call successors, (28), 26 states have call predecessors, (28), 25 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2022-01-31 10:39:40,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 209 transitions. [2022-01-31 10:39:40,190 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 209 transitions. Word has length 193 [2022-01-31 10:39:40,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:39:40,190 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 209 transitions. [2022-01-31 10:39:40,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 62 states have (on average 2.5161290322580645) internal successors, (156), 58 states have internal predecessors, (156), 45 states have call successors, (49), 5 states have call predecessors, (49), 3 states have return successors, (46), 45 states have call predecessors, (46), 43 states have call successors, (46) [2022-01-31 10:39:40,190 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 209 transitions. [2022-01-31 10:39:40,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-01-31 10:39:40,191 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:39:40,191 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 12, 12, 12, 12, 12, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:39:40,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-01-31 10:39:40,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-01-31 10:39:40,420 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:39:40,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:39:40,420 INFO L85 PathProgramCache]: Analyzing trace with hash 172689180, now seen corresponding path program 34 times [2022-01-31 10:39:40,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:39:40,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860128161] [2022-01-31 10:39:40,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:39:40,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:39:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:40,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:39:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:40,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:39:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:40,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:39:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:40,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:39:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:40,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:39:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:40,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:39:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:40,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:39:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:40,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:39:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:40,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:39:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:40,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:39:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:40,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:39:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:40,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:39:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:40,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:39:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:40,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:39:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:40,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:39:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:40,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-01-31 10:39:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:40,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-31 10:39:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:40,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-31 10:39:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:40,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-31 10:39:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:40,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:39:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:40,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:39:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:40,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:39:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:40,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:39:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:40,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:39:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 51 proven. 477 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2022-01-31 10:39:40,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:39:40,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860128161] [2022-01-31 10:39:40,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860128161] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:39:40,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077225314] [2022-01-31 10:39:40,979 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 10:39:40,980 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:39:40,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:39:40,980 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:39:41,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-01-31 10:39:41,144 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 10:39:41,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:39:41,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 63 conjunts are in the unsatisfiable core [2022-01-31 10:39:41,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:39:41,704 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:39:41,795 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:39:41,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 25 treesize of output 24 [2022-01-31 10:39:41,891 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:39:41,891 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:39:42,958 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:39:43,068 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 120 proven. 492 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-01-31 10:39:43,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:39:43,318 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 21 treesize of output 19 [2022-01-31 10:39:43,320 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 37 treesize of output 33 [2022-01-31 10:39:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 51 proven. 476 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2022-01-31 10:39:43,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077225314] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:39:43,572 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:39:43,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 62 [2022-01-31 10:39:43,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256097293] [2022-01-31 10:39:43,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:39:43,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-01-31 10:39:43,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:39:43,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-01-31 10:39:43,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=3556, Unknown=0, NotChecked=0, Total=3782 [2022-01-31 10:39:43,575 INFO L87 Difference]: Start difference. First operand 205 states and 209 transitions. Second operand has 62 states, 60 states have (on average 2.683333333333333) internal successors, (161), 55 states have internal predecessors, (161), 44 states have call successors, (51), 5 states have call predecessors, (51), 3 states have return successors, (47), 44 states have call predecessors, (47), 42 states have call successors, (47) [2022-01-31 10:39:45,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:39:45,056 INFO L93 Difference]: Finished difference Result 261 states and 273 transitions. [2022-01-31 10:39:45,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-31 10:39:45,057 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 60 states have (on average 2.683333333333333) internal successors, (161), 55 states have internal predecessors, (161), 44 states have call successors, (51), 5 states have call predecessors, (51), 3 states have return successors, (47), 44 states have call predecessors, (47), 42 states have call successors, (47) Word has length 193 [2022-01-31 10:39:45,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:39:45,058 INFO L225 Difference]: With dead ends: 261 [2022-01-31 10:39:45,058 INFO L226 Difference]: Without dead ends: 261 [2022-01-31 10:39:45,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 376 SyntacticMatches, 31 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3469 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=529, Invalid=8783, Unknown=0, NotChecked=0, Total=9312 [2022-01-31 10:39:45,059 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 141 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 3994 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 4364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 3994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 230 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 10:39:45,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 499 Invalid, 4364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 3994 Invalid, 0 Unknown, 230 Unchecked, 1.0s Time] [2022-01-31 10:39:45,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-01-31 10:39:45,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 239. [2022-01-31 10:39:45,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 176 states have (on average 1.0170454545454546) internal successors, (179), 178 states have internal predecessors, (179), 36 states have call successors, (36), 27 states have call predecessors, (36), 26 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-01-31 10:39:45,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 250 transitions. [2022-01-31 10:39:45,089 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 250 transitions. Word has length 193 [2022-01-31 10:39:45,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:39:45,089 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 250 transitions. [2022-01-31 10:39:45,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 60 states have (on average 2.683333333333333) internal successors, (161), 55 states have internal predecessors, (161), 44 states have call successors, (51), 5 states have call predecessors, (51), 3 states have return successors, (47), 44 states have call predecessors, (47), 42 states have call successors, (47) [2022-01-31 10:39:45,089 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 250 transitions. [2022-01-31 10:39:45,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-01-31 10:39:45,090 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:39:45,090 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:39:45,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-01-31 10:39:45,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:39:45,291 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:39:45,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:39:45,291 INFO L85 PathProgramCache]: Analyzing trace with hash 399471202, now seen corresponding path program 35 times [2022-01-31 10:39:45,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:39:45,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892589372] [2022-01-31 10:39:45,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:39:45,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:39:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:45,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:39:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:45,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:39:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:45,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:39:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:45,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:39:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:45,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:39:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:45,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:39:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:45,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:39:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:45,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:39:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:45,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:39:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:45,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:39:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:45,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:39:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:45,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:39:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:45,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:39:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:45,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:39:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:45,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-31 10:39:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:45,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-01-31 10:39:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:45,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-31 10:39:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:45,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-31 10:39:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:45,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-31 10:39:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:45,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:39:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:45,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:39:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:45,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:39:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:45,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:39:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:45,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:39:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:45,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:39:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:45,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 223 proven. 272 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2022-01-31 10:39:45,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:39:45,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892589372] [2022-01-31 10:39:45,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892589372] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:39:45,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114498791] [2022-01-31 10:39:45,582 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 10:39:45,583 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:39:45,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:39:45,596 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:39:45,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-01-31 10:39:45,742 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2022-01-31 10:39:45,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:39:45,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 26 conjunts are in the unsatisfiable core [2022-01-31 10:39:45,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:39:46,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 264 proven. 231 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2022-01-31 10:39:46,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:39:46,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 264 proven. 231 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2022-01-31 10:39:46,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114498791] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:39:46,558 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:39:46,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 42 [2022-01-31 10:39:46,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817479324] [2022-01-31 10:39:46,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:39:46,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-01-31 10:39:46,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:39:46,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-01-31 10:39:46,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1325, Unknown=0, NotChecked=0, Total=1722 [2022-01-31 10:39:46,559 INFO L87 Difference]: Start difference. First operand 239 states and 250 transitions. Second operand has 42 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 41 states have internal predecessors, (127), 37 states have call successors, (41), 3 states have call predecessors, (41), 1 states have return successors, (38), 36 states have call predecessors, (38), 36 states have call successors, (38) [2022-01-31 10:39:47,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:39:47,011 INFO L93 Difference]: Finished difference Result 263 states and 278 transitions. [2022-01-31 10:39:47,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-31 10:39:47,012 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 41 states have internal predecessors, (127), 37 states have call successors, (41), 3 states have call predecessors, (41), 1 states have return successors, (38), 36 states have call predecessors, (38), 36 states have call successors, (38) Word has length 201 [2022-01-31 10:39:47,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:39:47,012 INFO L225 Difference]: With dead ends: 263 [2022-01-31 10:39:47,012 INFO L226 Difference]: Without dead ends: 209 [2022-01-31 10:39:47,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 437 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=976, Invalid=3580, Unknown=0, NotChecked=0, Total=4556 [2022-01-31 10:39:47,014 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 206 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 10:39:47,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 89 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 10:39:47,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-01-31 10:39:47,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 196. [2022-01-31 10:39:47,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 144 states have (on average 1.0138888888888888) internal successors, (146), 145 states have internal predecessors, (146), 27 states have call successors, (27), 25 states have call predecessors, (27), 24 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-01-31 10:39:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 199 transitions. [2022-01-31 10:39:47,017 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 199 transitions. Word has length 201 [2022-01-31 10:39:47,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:39:47,017 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 199 transitions. [2022-01-31 10:39:47,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 41 states have internal predecessors, (127), 37 states have call successors, (41), 3 states have call predecessors, (41), 1 states have return successors, (38), 36 states have call predecessors, (38), 36 states have call successors, (38) [2022-01-31 10:39:47,017 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 199 transitions. [2022-01-31 10:39:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-01-31 10:39:47,018 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:39:47,018 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:39:47,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-01-31 10:39:47,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-01-31 10:39:47,236 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:39:47,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:39:47,236 INFO L85 PathProgramCache]: Analyzing trace with hash -703726546, now seen corresponding path program 36 times [2022-01-31 10:39:47,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:39:47,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800089803] [2022-01-31 10:39:47,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:39:47,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:39:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:47,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:39:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:47,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:39:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:47,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:39:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:47,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:39:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:47,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:39:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:47,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:39:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:47,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:39:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:47,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:39:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:47,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:39:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:47,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:39:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:47,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:39:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:47,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:39:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:47,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:39:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:47,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:39:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:47,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:39:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:47,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-01-31 10:39:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:47,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-31 10:39:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:47,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-31 10:39:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:47,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-31 10:39:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:47,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:39:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:47,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:39:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:47,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:39:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:47,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:39:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:47,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:39:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:47,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:39:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:47,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 56 proven. 512 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2022-01-31 10:39:47,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:39:47,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800089803] [2022-01-31 10:39:47,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800089803] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:39:47,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792575203] [2022-01-31 10:39:47,776 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 10:39:47,776 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:39:47,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:39:47,777 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:39:47,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-01-31 10:39:48,103 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-01-31 10:39:48,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:39:48,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 64 conjunts are in the unsatisfiable core [2022-01-31 10:39:48,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:39:48,650 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:39:50,817 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-31 10:39:50,817 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 27 treesize of output 26 [2022-01-31 10:39:52,670 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:39:52,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 102 proven. 532 refuted. 44 times theorem prover too weak. 362 trivial. 0 not checked. [2022-01-31 10:39:52,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:39:52,970 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 21 treesize of output 19 [2022-01-31 10:39:52,973 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 37 treesize of output 33 [2022-01-31 10:39:53,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 56 proven. 512 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2022-01-31 10:39:53,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792575203] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:39:53,367 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:39:53,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 34] total 66 [2022-01-31 10:39:53,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502439694] [2022-01-31 10:39:53,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:39:53,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-01-31 10:39:53,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:39:53,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-01-31 10:39:53,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=4035, Unknown=2, NotChecked=0, Total=4290 [2022-01-31 10:39:53,368 INFO L87 Difference]: Start difference. First operand 196 states and 199 transitions. Second operand has 66 states, 64 states have (on average 2.671875) internal successors, (171), 59 states have internal predecessors, (171), 47 states have call successors, (53), 6 states have call predecessors, (53), 4 states have return successors, (49), 47 states have call predecessors, (49), 45 states have call successors, (49) [2022-01-31 10:39:55,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:39:55,553 INFO L93 Difference]: Finished difference Result 298 states and 304 transitions. [2022-01-31 10:39:55,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-01-31 10:39:55,554 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 64 states have (on average 2.671875) internal successors, (171), 59 states have internal predecessors, (171), 47 states have call successors, (53), 6 states have call predecessors, (53), 4 states have return successors, (49), 47 states have call predecessors, (49), 45 states have call successors, (49) Word has length 201 [2022-01-31 10:39:55,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:39:55,555 INFO L225 Difference]: With dead ends: 298 [2022-01-31 10:39:55,555 INFO L226 Difference]: Without dead ends: 298 [2022-01-31 10:39:55,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 394 SyntacticMatches, 31 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3937 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=588, Invalid=9712, Unknown=2, NotChecked=0, Total=10302 [2022-01-31 10:39:55,555 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 142 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 4729 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 5042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 4729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 198 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-31 10:39:55,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 707 Invalid, 5042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 4729 Invalid, 0 Unknown, 198 Unchecked, 1.5s Time] [2022-01-31 10:39:55,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-01-31 10:39:55,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 213. [2022-01-31 10:39:55,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 157 states have (on average 1.019108280254777) internal successors, (160), 158 states have internal predecessors, (160), 29 states have call successors, (29), 27 states have call predecessors, (29), 26 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-01-31 10:39:55,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 217 transitions. [2022-01-31 10:39:55,559 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 217 transitions. Word has length 201 [2022-01-31 10:39:55,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:39:55,559 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 217 transitions. [2022-01-31 10:39:55,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 64 states have (on average 2.671875) internal successors, (171), 59 states have internal predecessors, (171), 47 states have call successors, (53), 6 states have call predecessors, (53), 4 states have return successors, (49), 47 states have call predecessors, (49), 45 states have call successors, (49) [2022-01-31 10:39:55,559 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 217 transitions. [2022-01-31 10:39:55,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-01-31 10:39:55,560 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:39:55,560 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:39:55,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-01-31 10:39:55,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-01-31 10:39:55,789 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:39:55,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:39:55,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1428439232, now seen corresponding path program 37 times [2022-01-31 10:39:55,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:39:55,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562781916] [2022-01-31 10:39:55,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:39:55,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:39:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:39:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:39:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:39:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:39:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:39:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:39:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:39:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:39:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:39:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:39:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:39:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:39:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:39:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:39:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:39:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-01-31 10:39:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-31 10:39:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-31 10:39:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-31 10:39:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:39:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:39:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:39:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:39:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:39:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:39:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:39:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1124 backedges. 61 proven. 551 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2022-01-31 10:39:56,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:39:56,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562781916] [2022-01-31 10:39:56,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562781916] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:39:56,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617153302] [2022-01-31 10:39:56,583 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 10:39:56,584 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:39:56,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:39:56,585 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:39:56,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-01-31 10:39:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:39:56,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 65 conjunts are in the unsatisfiable core [2022-01-31 10:39:56,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:39:57,308 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 13 treesize of output 9 [2022-01-31 10:39:58,544 INFO L353 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-01-31 10:39:58,544 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-31 10:39:58,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1124 backedges. 39 proven. 573 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2022-01-31 10:39:58,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:39:59,163 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 16 treesize of output 14 [2022-01-31 10:39:59,165 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 32 treesize of output 28 [2022-01-31 10:39:59,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617153302] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:39:59,262 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 10:39:59,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35] total 67 [2022-01-31 10:39:59,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534071325] [2022-01-31 10:39:59,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 10:39:59,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-01-31 10:39:59,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:39:59,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-01-31 10:39:59,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=6161, Unknown=0, NotChecked=0, Total=6480 [2022-01-31 10:39:59,264 INFO L87 Difference]: Start difference. First operand 213 states and 217 transitions. Second operand has 67 states, 64 states have (on average 2.640625) internal successors, (169), 60 states have internal predecessors, (169), 50 states have call successors, (54), 5 states have call predecessors, (54), 3 states have return successors, (50), 49 states have call predecessors, (50), 48 states have call successors, (50) [2022-01-31 10:40:02,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:40:02,061 INFO L93 Difference]: Finished difference Result 317 states and 325 transitions. [2022-01-31 10:40:02,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-01-31 10:40:02,061 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 64 states have (on average 2.640625) internal successors, (169), 60 states have internal predecessors, (169), 50 states have call successors, (54), 5 states have call predecessors, (54), 3 states have return successors, (50), 49 states have call predecessors, (50), 48 states have call successors, (50) Word has length 209 [2022-01-31 10:40:02,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:40:02,062 INFO L225 Difference]: With dead ends: 317 [2022-01-31 10:40:02,062 INFO L226 Difference]: Without dead ends: 317 [2022-01-31 10:40:02,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 292 SyntacticMatches, 24 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5726 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=734, Invalid=13072, Unknown=0, NotChecked=0, Total=13806 [2022-01-31 10:40:02,063 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 394 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 5642 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 6202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 5642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-31 10:40:02,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 509 Invalid, 6202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 5642 Invalid, 0 Unknown, 197 Unchecked, 1.7s Time] [2022-01-31 10:40:02,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-01-31 10:40:02,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 221. [2022-01-31 10:40:02,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 163 states have (on average 1.01840490797546) internal successors, (166), 164 states have internal predecessors, (166), 30 states have call successors, (30), 28 states have call predecessors, (30), 27 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-01-31 10:40:02,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 225 transitions. [2022-01-31 10:40:02,090 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 225 transitions. Word has length 209 [2022-01-31 10:40:02,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:40:02,090 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 225 transitions. [2022-01-31 10:40:02,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 64 states have (on average 2.640625) internal successors, (169), 60 states have internal predecessors, (169), 50 states have call successors, (54), 5 states have call predecessors, (54), 3 states have return successors, (50), 49 states have call predecessors, (50), 48 states have call successors, (50) [2022-01-31 10:40:02,090 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 225 transitions. [2022-01-31 10:40:02,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-01-31 10:40:02,091 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:40:02,091 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 13, 13, 13, 13, 13, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:40:02,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-01-31 10:40:02,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:40:02,308 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:40:02,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:40:02,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1763330316, now seen corresponding path program 38 times [2022-01-31 10:40:02,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:40:02,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718924870] [2022-01-31 10:40:02,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:40:02,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:40:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:02,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:40:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:02,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:40:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:02,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:40:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:02,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:40:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:02,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:40:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:02,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:40:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:02,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:40:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:02,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:40:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:02,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:40:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:02,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:40:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:02,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:40:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:02,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:40:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:02,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:40:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:02,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:40:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:02,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:40:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:02,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:40:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:02,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-31 10:40:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:02,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-31 10:40:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:02,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-31 10:40:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:02,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:40:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:02,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:40:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:02,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:40:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:02,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:40:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:02,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:40:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:02,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:40:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:02,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:40:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:02,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1145 backedges. 56 proven. 567 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2022-01-31 10:40:02,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:40:02,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718924870] [2022-01-31 10:40:02,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718924870] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:40:02,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269120288] [2022-01-31 10:40:02,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 10:40:02,890 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:40:02,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:40:02,912 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:40:02,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-01-31 10:40:03,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 10:40:03,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:40:03,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 67 conjunts are in the unsatisfiable core [2022-01-31 10:40:03,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:40:03,578 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:40:03,649 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:40:03,650 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:40:03,744 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:40:03,745 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:40:04,842 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:40:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1145 backedges. 131 proven. 584 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2022-01-31 10:40:04,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:40:05,297 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 21 treesize of output 19 [2022-01-31 10:40:05,299 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 37 treesize of output 33 [2022-01-31 10:40:05,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1145 backedges. 56 proven. 566 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2022-01-31 10:40:05,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269120288] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:40:05,570 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:40:05,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 66 [2022-01-31 10:40:05,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390538845] [2022-01-31 10:40:05,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:40:05,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-01-31 10:40:05,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:40:05,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-01-31 10:40:05,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=4048, Unknown=0, NotChecked=0, Total=4290 [2022-01-31 10:40:05,571 INFO L87 Difference]: Start difference. First operand 221 states and 225 transitions. Second operand has 66 states, 64 states have (on average 2.703125) internal successors, (173), 59 states have internal predecessors, (173), 48 states have call successors, (55), 5 states have call predecessors, (55), 3 states have return successors, (51), 48 states have call predecessors, (51), 46 states have call successors, (51) [2022-01-31 10:40:07,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:40:07,576 INFO L93 Difference]: Finished difference Result 281 states and 294 transitions. [2022-01-31 10:40:07,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-01-31 10:40:07,577 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 64 states have (on average 2.703125) internal successors, (173), 59 states have internal predecessors, (173), 48 states have call successors, (55), 5 states have call predecessors, (55), 3 states have return successors, (51), 48 states have call predecessors, (51), 46 states have call successors, (51) Word has length 209 [2022-01-31 10:40:07,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:40:07,578 INFO L225 Difference]: With dead ends: 281 [2022-01-31 10:40:07,578 INFO L226 Difference]: Without dead ends: 281 [2022-01-31 10:40:07,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 409 SyntacticMatches, 33 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3892 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=555, Invalid=9745, Unknown=2, NotChecked=0, Total=10302 [2022-01-31 10:40:07,578 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 178 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 4053 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 4395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 4053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 182 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 10:40:07,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 448 Invalid, 4395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 4053 Invalid, 0 Unknown, 182 Unchecked, 1.0s Time] [2022-01-31 10:40:07,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-01-31 10:40:07,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 259. [2022-01-31 10:40:07,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 191 states have (on average 1.0157068062827226) internal successors, (194), 193 states have internal predecessors, (194), 39 states have call successors, (39), 29 states have call predecessors, (39), 28 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2022-01-31 10:40:07,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 271 transitions. [2022-01-31 10:40:07,583 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 271 transitions. Word has length 209 [2022-01-31 10:40:07,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:40:07,583 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 271 transitions. [2022-01-31 10:40:07,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 64 states have (on average 2.703125) internal successors, (173), 59 states have internal predecessors, (173), 48 states have call successors, (55), 5 states have call predecessors, (55), 3 states have return successors, (51), 48 states have call predecessors, (51), 46 states have call successors, (51) [2022-01-31 10:40:07,583 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 271 transitions. [2022-01-31 10:40:07,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-01-31 10:40:07,584 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:40:07,584 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:40:07,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-01-31 10:40:07,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-01-31 10:40:07,785 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:40:07,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:40:07,785 INFO L85 PathProgramCache]: Analyzing trace with hash -268021678, now seen corresponding path program 39 times [2022-01-31 10:40:07,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:40:07,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698463078] [2022-01-31 10:40:07,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:40:07,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:40:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:40:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:40:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:40:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:40:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:40:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:40:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:40:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:40:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:40:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:40:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:40:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:40:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:40:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:40:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:40:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-01-31 10:40:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-31 10:40:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-31 10:40:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-31 10:40:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:40:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:40:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:40:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:40:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:40:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:40:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:40:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:40:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:08,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 267 proven. 321 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2022-01-31 10:40:08,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:40:08,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698463078] [2022-01-31 10:40:08,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698463078] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:40:08,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925320454] [2022-01-31 10:40:08,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 10:40:08,125 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:40:08,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:40:08,126 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:40:08,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-01-31 10:40:08,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2022-01-31 10:40:08,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:40:08,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 28 conjunts are in the unsatisfiable core [2022-01-31 10:40:08,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:40:09,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 312 proven. 276 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2022-01-31 10:40:09,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:40:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 312 proven. 276 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2022-01-31 10:40:09,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925320454] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:40:09,269 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:40:09,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 45 [2022-01-31 10:40:09,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025817034] [2022-01-31 10:40:09,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:40:09,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-01-31 10:40:09,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:40:09,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-01-31 10:40:09,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=1525, Unknown=0, NotChecked=0, Total=1980 [2022-01-31 10:40:09,271 INFO L87 Difference]: Start difference. First operand 259 states and 271 transitions. Second operand has 45 states, 45 states have (on average 3.022222222222222) internal successors, (136), 44 states have internal predecessors, (136), 40 states have call successors, (44), 3 states have call predecessors, (44), 1 states have return successors, (41), 39 states have call predecessors, (41), 39 states have call successors, (41) [2022-01-31 10:40:09,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:40:09,924 INFO L93 Difference]: Finished difference Result 283 states and 299 transitions. [2022-01-31 10:40:09,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-31 10:40:09,924 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.022222222222222) internal successors, (136), 44 states have internal predecessors, (136), 40 states have call successors, (44), 3 states have call predecessors, (44), 1 states have return successors, (41), 39 states have call predecessors, (41), 39 states have call successors, (41) Word has length 217 [2022-01-31 10:40:09,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:40:09,925 INFO L225 Difference]: With dead ends: 283 [2022-01-31 10:40:09,925 INFO L226 Difference]: Without dead ends: 225 [2022-01-31 10:40:09,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 472 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1511 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1120, Invalid=4136, Unknown=0, NotChecked=0, Total=5256 [2022-01-31 10:40:09,926 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 193 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 10:40:09,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 91 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 10:40:09,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-01-31 10:40:09,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 212. [2022-01-31 10:40:09,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 156 states have (on average 1.0128205128205128) internal successors, (158), 157 states have internal predecessors, (158), 29 states have call successors, (29), 27 states have call predecessors, (29), 26 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-01-31 10:40:09,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 215 transitions. [2022-01-31 10:40:09,929 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 215 transitions. Word has length 217 [2022-01-31 10:40:09,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:40:09,929 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 215 transitions. [2022-01-31 10:40:09,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.022222222222222) internal successors, (136), 44 states have internal predecessors, (136), 40 states have call successors, (44), 3 states have call predecessors, (44), 1 states have return successors, (41), 39 states have call predecessors, (41), 39 states have call successors, (41) [2022-01-31 10:40:09,929 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 215 transitions. [2022-01-31 10:40:09,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-01-31 10:40:09,930 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:40:09,930 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:40:09,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-01-31 10:40:10,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:40:10,130 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:40:10,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:40:10,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1446268446, now seen corresponding path program 40 times [2022-01-31 10:40:10,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:40:10,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007061565] [2022-01-31 10:40:10,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:40:10,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:40:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:40:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:40:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:40:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:40:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:40:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:40:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:40:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:40:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:40:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:40:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:40:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:40:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:40:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:40:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:40:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:40:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-31 10:40:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-31 10:40:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-31 10:40:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:40:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:40:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:40:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:40:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:40:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:40:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:40:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:40:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:10,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1229 backedges. 61 proven. 606 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2022-01-31 10:40:10,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:40:10,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007061565] [2022-01-31 10:40:10,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007061565] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:40:10,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037365349] [2022-01-31 10:40:10,870 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 10:40:10,870 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:40:10,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:40:10,871 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:40:10,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-01-31 10:40:11,050 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 10:40:11,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:40:11,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 68 conjunts are in the unsatisfiable core [2022-01-31 10:40:11,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:40:11,640 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:40:11,771 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:40:11,771 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:40:13,064 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 9 [2022-01-31 10:40:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1229 backedges. 89 proven. 628 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2022-01-31 10:40:13,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:40:13,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037365349] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:40:13,757 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 10:40:13,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36] total 70 [2022-01-31 10:40:13,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929256832] [2022-01-31 10:40:13,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 10:40:13,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-01-31 10:40:13,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:40:13,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-01-31 10:40:13,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=6442, Unknown=0, NotChecked=0, Total=6806 [2022-01-31 10:40:13,759 INFO L87 Difference]: Start difference. First operand 212 states and 215 transitions. Second operand has 70 states, 67 states have (on average 2.656716417910448) internal successors, (178), 63 states have internal predecessors, (178), 52 states have call successors, (56), 5 states have call predecessors, (56), 3 states have return successors, (52), 51 states have call predecessors, (52), 50 states have call successors, (52) [2022-01-31 10:40:16,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:40:16,754 INFO L93 Difference]: Finished difference Result 223 states and 227 transitions. [2022-01-31 10:40:16,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-01-31 10:40:16,755 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 67 states have (on average 2.656716417910448) internal successors, (178), 63 states have internal predecessors, (178), 52 states have call successors, (56), 5 states have call predecessors, (56), 3 states have return successors, (52), 51 states have call predecessors, (52), 50 states have call successors, (52) Word has length 217 [2022-01-31 10:40:16,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:40:16,755 INFO L225 Difference]: With dead ends: 223 [2022-01-31 10:40:16,755 INFO L226 Difference]: Without dead ends: 223 [2022-01-31 10:40:16,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 299 SyntacticMatches, 26 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6359 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=802, Invalid=14204, Unknown=0, NotChecked=0, Total=15006 [2022-01-31 10:40:16,756 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 238 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 5412 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 5894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 5412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 267 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-31 10:40:16,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 743 Invalid, 5894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 5412 Invalid, 0 Unknown, 267 Unchecked, 1.8s Time] [2022-01-31 10:40:16,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-01-31 10:40:16,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 220. [2022-01-31 10:40:16,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 162 states have (on average 1.0123456790123457) internal successors, (164), 163 states have internal predecessors, (164), 30 states have call successors, (30), 28 states have call predecessors, (30), 27 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-01-31 10:40:16,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 223 transitions. [2022-01-31 10:40:16,759 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 223 transitions. Word has length 217 [2022-01-31 10:40:16,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:40:16,759 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 223 transitions. [2022-01-31 10:40:16,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 67 states have (on average 2.656716417910448) internal successors, (178), 63 states have internal predecessors, (178), 52 states have call successors, (56), 5 states have call predecessors, (56), 3 states have return successors, (52), 51 states have call predecessors, (52), 50 states have call successors, (52) [2022-01-31 10:40:16,759 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 223 transitions. [2022-01-31 10:40:16,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-01-31 10:40:16,760 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:40:16,760 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:40:16,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-01-31 10:40:16,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:40:16,961 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:40:16,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:40:16,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1279861040, now seen corresponding path program 41 times [2022-01-31 10:40:16,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:40:16,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40772997] [2022-01-31 10:40:16,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:40:16,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:40:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:40:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:40:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:40:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:40:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:40:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:40:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:40:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:40:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:40:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:40:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:40:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:40:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:40:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:40:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:40:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:40:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-31 10:40:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-31 10:40:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-31 10:40:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:40:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:40:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:40:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:40:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:40:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:40:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:40:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:40:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:40:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:17,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1321 backedges. 66 proven. 649 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2022-01-31 10:40:17,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:40:17,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40772997] [2022-01-31 10:40:17,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40772997] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:40:17,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549433080] [2022-01-31 10:40:17,559 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 10:40:17,560 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:40:17,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:40:17,560 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:40:17,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-01-31 10:40:17,774 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2022-01-31 10:40:17,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:40:17,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 69 conjunts are in the unsatisfiable core [2022-01-31 10:40:17,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:40:18,462 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 13 treesize of output 9 [2022-01-31 10:40:19,650 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:40:19,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1321 backedges. 42 proven. 673 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2022-01-31 10:40:19,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:40:19,897 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 16 treesize of output 14 [2022-01-31 10:40:19,899 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 32 treesize of output 28 [2022-01-31 10:40:20,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1321 backedges. 66 proven. 649 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2022-01-31 10:40:20,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549433080] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:40:20,156 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:40:20,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 36] total 70 [2022-01-31 10:40:20,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775730892] [2022-01-31 10:40:20,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:40:20,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-01-31 10:40:20,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:40:20,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-01-31 10:40:20,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=4590, Unknown=0, NotChecked=0, Total=4830 [2022-01-31 10:40:20,158 INFO L87 Difference]: Start difference. First operand 220 states and 223 transitions. Second operand has 70 states, 68 states have (on average 2.6911764705882355) internal successors, (183), 63 states have internal predecessors, (183), 53 states have call successors, (59), 5 states have call predecessors, (59), 3 states have return successors, (55), 53 states have call predecessors, (55), 51 states have call successors, (55) [2022-01-31 10:40:22,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:40:22,618 INFO L93 Difference]: Finished difference Result 340 states and 348 transitions. [2022-01-31 10:40:22,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-01-31 10:40:22,618 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 68 states have (on average 2.6911764705882355) internal successors, (183), 63 states have internal predecessors, (183), 53 states have call successors, (59), 5 states have call predecessors, (59), 3 states have return successors, (55), 53 states have call predecessors, (55), 51 states have call successors, (55) Word has length 225 [2022-01-31 10:40:22,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:40:22,619 INFO L225 Difference]: With dead ends: 340 [2022-01-31 10:40:22,619 INFO L226 Difference]: Without dead ends: 340 [2022-01-31 10:40:22,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 458 SyntacticMatches, 29 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4108 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=548, Invalid=10794, Unknown=0, NotChecked=0, Total=11342 [2022-01-31 10:40:22,621 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 226 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 8408 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 8874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 8408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 276 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-31 10:40:22,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 803 Invalid, 8874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 8408 Invalid, 0 Unknown, 276 Unchecked, 2.0s Time] [2022-01-31 10:40:22,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-01-31 10:40:22,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 233. [2022-01-31 10:40:22,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 172 states have (on average 1.0174418604651163) internal successors, (175), 173 states have internal predecessors, (175), 32 states have call successors, (32), 29 states have call predecessors, (32), 28 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-01-31 10:40:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 238 transitions. [2022-01-31 10:40:22,628 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 238 transitions. Word has length 225 [2022-01-31 10:40:22,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:40:22,628 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 238 transitions. [2022-01-31 10:40:22,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 68 states have (on average 2.6911764705882355) internal successors, (183), 63 states have internal predecessors, (183), 53 states have call successors, (59), 5 states have call predecessors, (59), 3 states have return successors, (55), 53 states have call predecessors, (55), 51 states have call successors, (55) [2022-01-31 10:40:22,628 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 238 transitions. [2022-01-31 10:40:22,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2022-01-31 10:40:22,648 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:40:22,648 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:40:22,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-01-31 10:40:22,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-01-31 10:40:22,848 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:40:22,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:40:22,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1028996542, now seen corresponding path program 42 times [2022-01-31 10:40:22,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:40:22,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090580082] [2022-01-31 10:40:22,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:40:22,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:40:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:40:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:40:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:40:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:40:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:40:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:40:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:40:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:40:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:40:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:40:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:40:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:40:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:40:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:40:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:40:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:40:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-31 10:40:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-31 10:40:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-31 10:40:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:40:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:40:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:40:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:40:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:40:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:40:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:40:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:40:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:40:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:40:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:23,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1421 backedges. 315 proven. 374 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2022-01-31 10:40:23,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:40:23,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090580082] [2022-01-31 10:40:23,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090580082] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:40:23,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387001675] [2022-01-31 10:40:23,181 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 10:40:23,181 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:40:23,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:40:23,182 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:40:23,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-01-31 10:40:23,667 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-01-31 10:40:23,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:40:23,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 30 conjunts are in the unsatisfiable core [2022-01-31 10:40:23,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:40:24,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1421 backedges. 364 proven. 325 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2022-01-31 10:40:24,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:40:24,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1421 backedges. 364 proven. 325 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2022-01-31 10:40:24,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387001675] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:40:24,545 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:40:24,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 48 [2022-01-31 10:40:24,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118155093] [2022-01-31 10:40:24,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:40:24,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-31 10:40:24,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:40:24,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-31 10:40:24,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=517, Invalid=1739, Unknown=0, NotChecked=0, Total=2256 [2022-01-31 10:40:24,547 INFO L87 Difference]: Start difference. First operand 233 states and 238 transitions. Second operand has 48 states, 48 states have (on average 3.0208333333333335) internal successors, (145), 47 states have internal predecessors, (145), 43 states have call successors, (47), 3 states have call predecessors, (47), 1 states have return successors, (44), 42 states have call predecessors, (44), 42 states have call successors, (44) [2022-01-31 10:40:25,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:40:25,060 INFO L93 Difference]: Finished difference Result 295 states and 314 transitions. [2022-01-31 10:40:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-31 10:40:25,061 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.0208333333333335) internal successors, (145), 47 states have internal predecessors, (145), 43 states have call successors, (47), 3 states have call predecessors, (47), 1 states have return successors, (44), 42 states have call predecessors, (44), 42 states have call successors, (44) Word has length 233 [2022-01-31 10:40:25,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:40:25,061 INFO L225 Difference]: With dead ends: 295 [2022-01-31 10:40:25,061 INFO L226 Difference]: Without dead ends: 237 [2022-01-31 10:40:25,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 507 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1734 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1274, Invalid=4732, Unknown=0, NotChecked=0, Total=6006 [2022-01-31 10:40:25,062 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 289 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 10:40:25,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 93 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 10:40:25,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-01-31 10:40:25,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 224. [2022-01-31 10:40:25,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 165 states have (on average 1.0121212121212122) internal successors, (167), 166 states have internal predecessors, (167), 31 states have call successors, (31), 28 states have call predecessors, (31), 27 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-01-31 10:40:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 228 transitions. [2022-01-31 10:40:25,066 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 228 transitions. Word has length 233 [2022-01-31 10:40:25,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:40:25,066 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 228 transitions. [2022-01-31 10:40:25,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.0208333333333335) internal successors, (145), 47 states have internal predecessors, (145), 43 states have call successors, (47), 3 states have call predecessors, (47), 1 states have return successors, (44), 42 states have call predecessors, (44), 42 states have call successors, (44) [2022-01-31 10:40:25,066 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 228 transitions. [2022-01-31 10:40:25,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2022-01-31 10:40:25,068 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:40:25,068 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 16, 14, 14, 14, 14, 14, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:40:25,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-01-31 10:40:25,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-01-31 10:40:25,300 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:40:25,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:40:25,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1947481102, now seen corresponding path program 43 times [2022-01-31 10:40:25,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:40:25,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789705175] [2022-01-31 10:40:25,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:40:25,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:40:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:40:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:40:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:40:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:40:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:40:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:40:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:40:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:40:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:40:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:40:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:40:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:40:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:40:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:40:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:40:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:40:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:40:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-31 10:40:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-31 10:40:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:40:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:40:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:40:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:40:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:40:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:40:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:40:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:40:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:40:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:40:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:25,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1434 backedges. 66 proven. 708 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2022-01-31 10:40:25,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:40:25,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789705175] [2022-01-31 10:40:25,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789705175] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:40:25,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65174796] [2022-01-31 10:40:25,833 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 10:40:25,833 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:40:25,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:40:25,834 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:40:25,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-01-31 10:40:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:26,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 72 conjunts are in the unsatisfiable core [2022-01-31 10:40:26,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:40:26,562 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:40:30,792 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-31 10:40:30,792 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 27 treesize of output 26 [2022-01-31 10:40:33,283 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:40:33,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1434 backedges. 144 proven. 732 refuted. 32 times theorem prover too weak. 526 trivial. 0 not checked. [2022-01-31 10:40:33,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:40:33,600 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 21 treesize of output 19 [2022-01-31 10:40:33,601 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 37 treesize of output 33 [2022-01-31 10:40:34,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1434 backedges. 66 proven. 708 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2022-01-31 10:40:34,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65174796] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:40:34,024 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:40:34,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 38] total 76 [2022-01-31 10:40:34,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107674582] [2022-01-31 10:40:34,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:40:34,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-01-31 10:40:34,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:40:34,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-01-31 10:40:34,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=5401, Unknown=3, NotChecked=0, Total=5700 [2022-01-31 10:40:34,026 INFO L87 Difference]: Start difference. First operand 224 states and 228 transitions. Second operand has 76 states, 73 states have (on average 2.684931506849315) internal successors, (196), 68 states have internal predecessors, (196), 56 states have call successors, (62), 6 states have call predecessors, (62), 4 states have return successors, (58), 56 states have call predecessors, (58), 54 states have call successors, (58) [2022-01-31 10:40:37,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:40:37,715 INFO L93 Difference]: Finished difference Result 342 states and 349 transitions. [2022-01-31 10:40:37,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-01-31 10:40:37,731 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 73 states have (on average 2.684931506849315) internal successors, (196), 68 states have internal predecessors, (196), 56 states have call successors, (62), 6 states have call predecessors, (62), 4 states have return successors, (58), 56 states have call predecessors, (58), 54 states have call successors, (58) Word has length 233 [2022-01-31 10:40:37,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:40:37,732 INFO L225 Difference]: With dead ends: 342 [2022-01-31 10:40:37,732 INFO L226 Difference]: Without dead ends: 342 [2022-01-31 10:40:37,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 458 SyntacticMatches, 34 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5362 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=709, Invalid=13327, Unknown=6, NotChecked=0, Total=14042 [2022-01-31 10:40:37,733 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 158 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 5548 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 5974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 5548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 287 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-31 10:40:37,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 873 Invalid, 5974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 5548 Invalid, 0 Unknown, 287 Unchecked, 1.7s Time] [2022-01-31 10:40:37,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-01-31 10:40:37,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 241. [2022-01-31 10:40:37,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 178 states have (on average 1.0168539325842696) internal successors, (181), 179 states have internal predecessors, (181), 33 states have call successors, (33), 30 states have call predecessors, (33), 29 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2022-01-31 10:40:37,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 246 transitions. [2022-01-31 10:40:37,738 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 246 transitions. Word has length 233 [2022-01-31 10:40:37,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:40:37,739 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 246 transitions. [2022-01-31 10:40:37,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 73 states have (on average 2.684931506849315) internal successors, (196), 68 states have internal predecessors, (196), 56 states have call successors, (62), 6 states have call predecessors, (62), 4 states have return successors, (58), 56 states have call predecessors, (58), 54 states have call successors, (58) [2022-01-31 10:40:37,739 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 246 transitions. [2022-01-31 10:40:37,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-01-31 10:40:37,740 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:40:37,740 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 16, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:40:37,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-01-31 10:40:37,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-01-31 10:40:37,940 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:40:37,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:40:37,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1385961248, now seen corresponding path program 44 times [2022-01-31 10:40:37,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:40:37,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513761778] [2022-01-31 10:40:37,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:40:37,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:40:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:40:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:40:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:40:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:40:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:40:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:40:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:40:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:40:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:40:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:40:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:40:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:40:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:40:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:40:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:40:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:40:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:40:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-31 10:40:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-31 10:40:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:40:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:40:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:40:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:40:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:40:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:40:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:40:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:40:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:40:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:40:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:40:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:40:38,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 71 proven. 755 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2022-01-31 10:40:38,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:40:38,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513761778] [2022-01-31 10:40:38,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513761778] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:40:38,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330760471] [2022-01-31 10:40:38,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 10:40:38,624 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:40:38,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:40:38,625 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:40:38,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-01-31 10:40:38,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 10:40:38,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:40:38,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 48 conjunts are in the unsatisfiable core [2022-01-31 10:40:38,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:40:39,681 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:40:41,358 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.base_BEFORE_CALL_470| Int) (|v_main_~#a~0.offset_BEFORE_CALL_470| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_470|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_470|))))) is different from true [2022-01-31 10:40:43,028 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_471| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_471| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_471|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_471|))))) is different from true [2022-01-31 10:40:44,874 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_472| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_472| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_472|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_472|))))) is different from true [2022-01-31 10:40:46,618 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_473| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_473| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_473|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_473|))))) is different from true [2022-01-31 10:40:48,292 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_474| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_474| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_474|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_474|))))) is different from true [2022-01-31 10:40:49,809 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_475| Int) (|v_main_~#a~0.base_BEFORE_CALL_475| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_475|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_475|))))) is different from true [2022-01-31 10:40:51,391 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_476| Int) (|v_main_~#a~0.base_BEFORE_CALL_476| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_476|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_476|))))) is different from true [2022-01-31 10:40:53,062 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.offset_BEFORE_CALL_477| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.base_BEFORE_CALL_477| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_477|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_477|))))) is different from true [2022-01-31 10:41:01,208 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_477| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.base_BEFORE_CALL_477| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_477|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_477|))))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_478| Int) (|v_main_~#a~0.base_BEFORE_CALL_478| Int) (v_main_~i~0_1310 Int)) (and (< (+ v_main_~i~0_1310 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_478|) (+ (* v_main_~i~0_1310 4) |v_main_~#a~0.offset_BEFORE_CALL_478|))) (<= v_main_~i~0_1310 14)))) is different from true [2022-01-31 10:41:10,954 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.offset_BEFORE_CALL_479| Int) (|v_main_~#a~0.base_BEFORE_CALL_479| Int) (v_main_~i~0_1310 Int)) (and (<= v_main_~i~0_1310 14) (< (+ v_main_~i~0_1310 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_479|) (+ (* v_main_~i~0_1310 4) |v_main_~#a~0.offset_BEFORE_CALL_479|))))) is different from true [2022-01-31 10:41:21,355 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_1313 Int) (|v_main_~#a~0.base_BEFORE_CALL_480| Int) (|v_main_~#a~0.offset_BEFORE_CALL_480| Int)) (and (< (+ v_main_~i~0_1313 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_480|) (+ (* v_main_~i~0_1313 4) |v_main_~#a~0.offset_BEFORE_CALL_480|))) (<= v_main_~i~0_1313 14))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_479| Int) (|v_main_~#a~0.base_BEFORE_CALL_479| Int) (v_main_~i~0_1310 Int)) (and (<= v_main_~i~0_1310 14) (< (+ v_main_~i~0_1310 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_479|) (+ (* v_main_~i~0_1310 4) |v_main_~#a~0.offset_BEFORE_CALL_479|)))))) is different from true [2022-01-31 10:41:27,495 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_1313 Int) (|v_main_~#a~0.base_BEFORE_CALL_481| Int) (|v_main_~#a~0.offset_BEFORE_CALL_481| Int)) (and (< (+ v_main_~i~0_1313 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_481|) (+ (* v_main_~i~0_1313 4) |v_main_~#a~0.offset_BEFORE_CALL_481|))) (<= v_main_~i~0_1313 14))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_479| Int) (|v_main_~#a~0.base_BEFORE_CALL_479| Int) (v_main_~i~0_1310 Int)) (and (<= v_main_~i~0_1310 14) (< (+ v_main_~i~0_1310 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_479|) (+ (* v_main_~i~0_1310 4) |v_main_~#a~0.offset_BEFORE_CALL_479|)))))) is different from true [2022-01-31 10:41:33,775 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_479| Int) (|v_main_~#a~0.base_BEFORE_CALL_479| Int) (v_main_~i~0_1310 Int)) (and (<= v_main_~i~0_1310 14) (< (+ v_main_~i~0_1310 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_479|) (+ (* v_main_~i~0_1310 4) |v_main_~#a~0.offset_BEFORE_CALL_479|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_482| Int) (v_main_~i~0_1313 Int) (|v_main_~#a~0.offset_BEFORE_CALL_482| Int)) (and (< (+ v_main_~i~0_1313 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_482|) (+ (* v_main_~i~0_1313 4) |v_main_~#a~0.offset_BEFORE_CALL_482|))) (<= v_main_~i~0_1313 14)))) is different from true [2022-01-31 10:41:35,889 INFO L353 Elim1Store]: treesize reduction 33, result has 42.1 percent of original size [2022-01-31 10:41:35,889 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 38 treesize of output 37 [2022-01-31 10:41:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 370 proven. 430 refuted. 0 times theorem prover too weak. 396 trivial. 338 not checked. [2022-01-31 10:41:36,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:41:36,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330760471] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:41:36,192 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 10:41:36,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 56] total 92 [2022-01-31 10:41:36,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995788374] [2022-01-31 10:41:36,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 10:41:36,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-01-31 10:41:36,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:41:36,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-01-31 10:41:36,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=6024, Unknown=16, NotChecked=2210, Total=8742 [2022-01-31 10:41:36,195 INFO L87 Difference]: Start difference. First operand 241 states and 246 transitions. Second operand has 92 states, 90 states have (on average 2.533333333333333) internal successors, (228), 85 states have internal predecessors, (228), 57 states have call successors, (61), 17 states have call predecessors, (61), 15 states have return successors, (58), 57 states have call predecessors, (58), 55 states have call successors, (58) [2022-01-31 10:41:41,570 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.base_BEFORE_CALL_470| Int) (|v_main_~#a~0.offset_BEFORE_CALL_470| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_470|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_470|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_471| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_471| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_471|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_471|)))))) is different from true [2022-01-31 10:41:43,603 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.base_BEFORE_CALL_470| Int) (|v_main_~#a~0.offset_BEFORE_CALL_470| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_470|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_470|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_471| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_471| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_471|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_471|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_472| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_472| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_472|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_472|)))))) is different from true [2022-01-31 10:41:45,635 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.base_BEFORE_CALL_470| Int) (|v_main_~#a~0.offset_BEFORE_CALL_470| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_470|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_470|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_471| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_471| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_471|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_471|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_472| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_472| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_472|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_472|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_473| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_473| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_473|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_473|)))))) is different from true [2022-01-31 10:41:47,669 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.base_BEFORE_CALL_470| Int) (|v_main_~#a~0.offset_BEFORE_CALL_470| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_470|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_470|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_471| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_471| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_471|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_471|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_472| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_472| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_472|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_472|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_473| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_473| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_473|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_473|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_474| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_474| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_474|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_474|)))))) is different from true [2022-01-31 10:41:49,702 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.base_BEFORE_CALL_470| Int) (|v_main_~#a~0.offset_BEFORE_CALL_470| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_470|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_470|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_471| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_471| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_471|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_471|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_472| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_472| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_472|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_472|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_473| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_473| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_473|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_473|))))) (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_475| Int) (|v_main_~#a~0.base_BEFORE_CALL_475| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_475|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_475|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_474| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_474| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_474|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_474|)))))) is different from true [2022-01-31 10:41:51,144 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.base_BEFORE_CALL_470| Int) (|v_main_~#a~0.offset_BEFORE_CALL_470| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_470|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_470|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_471| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_471| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_471|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_471|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_472| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_472| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_472|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_472|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_473| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_473| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_473|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_473|))))) (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_475| Int) (|v_main_~#a~0.base_BEFORE_CALL_475| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_475|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_475|))))) (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_476| Int) (|v_main_~#a~0.base_BEFORE_CALL_476| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_476|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_476|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_474| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_474| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_474|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_474|)))))) is different from true [2022-01-31 10:41:55,075 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.base_BEFORE_CALL_470| Int) (|v_main_~#a~0.offset_BEFORE_CALL_470| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_470|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_470|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_471| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_471| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_471|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_471|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_472| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_472| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_472|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_472|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_473| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_473| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_473|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_473|))))) (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_475| Int) (|v_main_~#a~0.base_BEFORE_CALL_475| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_475|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_475|))))) (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_476| Int) (|v_main_~#a~0.base_BEFORE_CALL_476| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_476|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_476|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_474| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_474| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_474|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_474|))))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_477| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.base_BEFORE_CALL_477| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_477|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_477|)))))) is different from true [2022-01-31 10:42:03,160 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.base_BEFORE_CALL_470| Int) (|v_main_~#a~0.offset_BEFORE_CALL_470| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_470|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_470|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_471| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_471| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_471|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_471|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_472| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_472| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_472|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_472|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_473| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_473| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_473|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_473|))))) (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_475| Int) (|v_main_~#a~0.base_BEFORE_CALL_475| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_475|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_475|))))) (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_476| Int) (|v_main_~#a~0.base_BEFORE_CALL_476| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_476|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_476|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_474| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_474| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_474|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_474|))))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_477| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.base_BEFORE_CALL_477| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_477|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_477|))))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_478| Int) (|v_main_~#a~0.base_BEFORE_CALL_478| Int) (v_main_~i~0_1310 Int)) (and (< (+ v_main_~i~0_1310 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_478|) (+ (* v_main_~i~0_1310 4) |v_main_~#a~0.offset_BEFORE_CALL_478|))) (<= v_main_~i~0_1310 14)))) is different from true [2022-01-31 10:42:09,230 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.base_BEFORE_CALL_470| Int) (|v_main_~#a~0.offset_BEFORE_CALL_470| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_470|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_470|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_471| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_471| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_471|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_471|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_472| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_472| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_472|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_472|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_473| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_473| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_473|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_473|))))) (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_475| Int) (|v_main_~#a~0.base_BEFORE_CALL_475| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_475|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_475|))))) (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_476| Int) (|v_main_~#a~0.base_BEFORE_CALL_476| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_476|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_476|))))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_479| Int) (|v_main_~#a~0.base_BEFORE_CALL_479| Int) (v_main_~i~0_1310 Int)) (and (<= v_main_~i~0_1310 14) (< (+ v_main_~i~0_1310 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_479|) (+ (* v_main_~i~0_1310 4) |v_main_~#a~0.offset_BEFORE_CALL_479|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_474| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_474| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_474|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_474|))))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_477| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.base_BEFORE_CALL_477| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_477|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_477|))))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_478| Int) (|v_main_~#a~0.base_BEFORE_CALL_478| Int) (v_main_~i~0_1310 Int)) (and (< (+ v_main_~i~0_1310 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_478|) (+ (* v_main_~i~0_1310 4) |v_main_~#a~0.offset_BEFORE_CALL_478|))) (<= v_main_~i~0_1310 14)))) is different from true [2022-01-31 10:42:17,326 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.base_BEFORE_CALL_470| Int) (|v_main_~#a~0.offset_BEFORE_CALL_470| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_470|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_470|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_471| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_471| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_471|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_471|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_472| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_472| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_472|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_472|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_473| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_473| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_473|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_473|))))) (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_475| Int) (|v_main_~#a~0.base_BEFORE_CALL_475| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_475|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_475|))))) (exists ((v_main_~i~0_1313 Int) (|v_main_~#a~0.base_BEFORE_CALL_480| Int) (|v_main_~#a~0.offset_BEFORE_CALL_480| Int)) (and (< (+ v_main_~i~0_1313 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_480|) (+ (* v_main_~i~0_1313 4) |v_main_~#a~0.offset_BEFORE_CALL_480|))) (<= v_main_~i~0_1313 14))) (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_476| Int) (|v_main_~#a~0.base_BEFORE_CALL_476| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_476|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_476|))))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_479| Int) (|v_main_~#a~0.base_BEFORE_CALL_479| Int) (v_main_~i~0_1310 Int)) (and (<= v_main_~i~0_1310 14) (< (+ v_main_~i~0_1310 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_479|) (+ (* v_main_~i~0_1310 4) |v_main_~#a~0.offset_BEFORE_CALL_479|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_474| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_474| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_474|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_474|))))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_477| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.base_BEFORE_CALL_477| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_477|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_477|))))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_478| Int) (|v_main_~#a~0.base_BEFORE_CALL_478| Int) (v_main_~i~0_1310 Int)) (and (< (+ v_main_~i~0_1310 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_478|) (+ (* v_main_~i~0_1310 4) |v_main_~#a~0.offset_BEFORE_CALL_478|))) (<= v_main_~i~0_1310 14)))) is different from true [2022-01-31 10:42:21,107 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.base_BEFORE_CALL_470| Int) (|v_main_~#a~0.offset_BEFORE_CALL_470| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_470|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_470|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_471| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_471| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_471|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_471|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_472| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_472| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_472|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_472|))))) (exists ((v_main_~i~0_1313 Int) (|v_main_~#a~0.base_BEFORE_CALL_481| Int) (|v_main_~#a~0.offset_BEFORE_CALL_481| Int)) (and (< (+ v_main_~i~0_1313 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_481|) (+ (* v_main_~i~0_1313 4) |v_main_~#a~0.offset_BEFORE_CALL_481|))) (<= v_main_~i~0_1313 14))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_473| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_473| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_473|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_473|))))) (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_475| Int) (|v_main_~#a~0.base_BEFORE_CALL_475| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_475|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_475|))))) (exists ((v_main_~i~0_1313 Int) (|v_main_~#a~0.base_BEFORE_CALL_480| Int) (|v_main_~#a~0.offset_BEFORE_CALL_480| Int)) (and (< (+ v_main_~i~0_1313 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_480|) (+ (* v_main_~i~0_1313 4) |v_main_~#a~0.offset_BEFORE_CALL_480|))) (<= v_main_~i~0_1313 14))) (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_476| Int) (|v_main_~#a~0.base_BEFORE_CALL_476| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_476|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_476|))))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_479| Int) (|v_main_~#a~0.base_BEFORE_CALL_479| Int) (v_main_~i~0_1310 Int)) (and (<= v_main_~i~0_1310 14) (< (+ v_main_~i~0_1310 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_479|) (+ (* v_main_~i~0_1310 4) |v_main_~#a~0.offset_BEFORE_CALL_479|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_474| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_474| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_474|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_474|))))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_477| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.base_BEFORE_CALL_477| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_477|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_477|))))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_478| Int) (|v_main_~#a~0.base_BEFORE_CALL_478| Int) (v_main_~i~0_1310 Int)) (and (< (+ v_main_~i~0_1310 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_478|) (+ (* v_main_~i~0_1310 4) |v_main_~#a~0.offset_BEFORE_CALL_478|))) (<= v_main_~i~0_1310 14)))) is different from true [2022-01-31 10:42:24,769 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.base_BEFORE_CALL_470| Int) (|v_main_~#a~0.offset_BEFORE_CALL_470| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_470|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_470|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_471| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_471| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_471|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_471|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_472| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_472| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_472|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_472|))))) (exists ((v_main_~i~0_1313 Int) (|v_main_~#a~0.base_BEFORE_CALL_481| Int) (|v_main_~#a~0.offset_BEFORE_CALL_481| Int)) (and (< (+ v_main_~i~0_1313 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_481|) (+ (* v_main_~i~0_1313 4) |v_main_~#a~0.offset_BEFORE_CALL_481|))) (<= v_main_~i~0_1313 14))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_473| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_473| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_473|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_473|))))) (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_475| Int) (|v_main_~#a~0.base_BEFORE_CALL_475| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_475|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_475|))))) (exists ((v_main_~i~0_1313 Int) (|v_main_~#a~0.base_BEFORE_CALL_480| Int) (|v_main_~#a~0.offset_BEFORE_CALL_480| Int)) (and (< (+ v_main_~i~0_1313 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_480|) (+ (* v_main_~i~0_1313 4) |v_main_~#a~0.offset_BEFORE_CALL_480|))) (<= v_main_~i~0_1313 14))) (exists ((v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_476| Int) (|v_main_~#a~0.base_BEFORE_CALL_476| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_476|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_476|))))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_479| Int) (|v_main_~#a~0.base_BEFORE_CALL_479| Int) (v_main_~i~0_1310 Int)) (and (<= v_main_~i~0_1310 14) (< (+ v_main_~i~0_1310 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_479|) (+ (* v_main_~i~0_1310 4) |v_main_~#a~0.offset_BEFORE_CALL_479|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_474| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.offset_BEFORE_CALL_474| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_474|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_474|))))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_482| Int) (v_main_~i~0_1313 Int) (|v_main_~#a~0.offset_BEFORE_CALL_482| Int)) (and (< (+ v_main_~i~0_1313 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_482|) (+ (* v_main_~i~0_1313 4) |v_main_~#a~0.offset_BEFORE_CALL_482|))) (<= v_main_~i~0_1313 14))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_477| Int) (v_main_~i~0_1301 Int) (|v_main_~#a~0.base_BEFORE_CALL_477| Int)) (and (<= v_main_~i~0_1301 14) (< (+ v_main_~i~0_1301 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_477|) (+ (* v_main_~i~0_1301 4) |v_main_~#a~0.offset_BEFORE_CALL_477|))))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_478| Int) (|v_main_~#a~0.base_BEFORE_CALL_478| Int) (v_main_~i~0_1310 Int)) (and (< (+ v_main_~i~0_1310 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_478|) (+ (* v_main_~i~0_1310 4) |v_main_~#a~0.offset_BEFORE_CALL_478|))) (<= v_main_~i~0_1310 14)))) is different from true [2022-01-31 10:42:40,458 WARN L228 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 123 DAG size of output: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 10:42:45,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:42:45,575 INFO L93 Difference]: Finished difference Result 346 states and 351 transitions. [2022-01-31 10:42:45,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-01-31 10:42:45,576 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 90 states have (on average 2.533333333333333) internal successors, (228), 85 states have internal predecessors, (228), 57 states have call successors, (61), 17 states have call predecessors, (61), 15 states have return successors, (58), 57 states have call predecessors, (58), 55 states have call successors, (58) Word has length 241 [2022-01-31 10:42:45,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:42:45,576 INFO L225 Difference]: With dead ends: 346 [2022-01-31 10:42:45,576 INFO L226 Difference]: Without dead ends: 232 [2022-01-31 10:42:45,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 274 SyntacticMatches, 11 SemanticMatches, 185 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 7755 ImplicationChecksByTransitivity, 124.8s TimeCoverageRelationStatistics Valid=1772, Invalid=24375, Unknown=35, NotChecked=8600, Total=34782 [2022-01-31 10:42:45,578 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 86 mSDsluCounter, 1473 mSDsCounter, 0 mSdLazyCounter, 2641 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 6429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3665 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 10:42:45,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 1575 Invalid, 6429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2641 Invalid, 0 Unknown, 3665 Unchecked, 1.0s Time] [2022-01-31 10:42:45,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-01-31 10:42:45,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2022-01-31 10:42:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 171 states have (on average 1.0116959064327486) internal successors, (173), 172 states have internal predecessors, (173), 32 states have call successors, (32), 29 states have call predecessors, (32), 28 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-01-31 10:42:45,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 236 transitions. [2022-01-31 10:42:45,581 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 236 transitions. Word has length 241 [2022-01-31 10:42:45,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:42:45,581 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 236 transitions. [2022-01-31 10:42:45,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 90 states have (on average 2.533333333333333) internal successors, (228), 85 states have internal predecessors, (228), 57 states have call successors, (61), 17 states have call predecessors, (61), 15 states have return successors, (58), 57 states have call predecessors, (58), 55 states have call successors, (58) [2022-01-31 10:42:45,581 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 236 transitions. [2022-01-31 10:42:45,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-01-31 10:42:45,582 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:42:45,582 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 17, 15, 15, 15, 15, 15, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:42:45,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-01-31 10:42:45,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:42:45,791 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:42:45,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:42:45,792 INFO L85 PathProgramCache]: Analyzing trace with hash 67471596, now seen corresponding path program 45 times [2022-01-31 10:42:45,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:42:45,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456787217] [2022-01-31 10:42:45,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:42:45,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:42:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:42:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:42:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:42:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:42:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:42:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:42:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:42:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:42:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:42:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:42:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:42:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:42:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:42:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:42:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:42:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:42:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:42:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:42:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-31 10:42:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:42:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:42:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:42:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:42:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:42:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:42:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:42:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:42:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:42:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:42:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:42:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:46,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1555 backedges. 66 proven. 771 refuted. 0 times theorem prover too weak. 718 trivial. 0 not checked. [2022-01-31 10:42:46,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:42:46,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456787217] [2022-01-31 10:42:46,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456787217] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:42:46,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332789958] [2022-01-31 10:42:46,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 10:42:46,499 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:42:46,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:42:46,536 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:42:46,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-01-31 10:42:47,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2022-01-31 10:42:47,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:42:47,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 75 conjunts are in the unsatisfiable core [2022-01-31 10:42:47,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:42:47,955 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:42:48,053 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:42:48,054 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:42:48,180 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:42:48,181 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:42:49,514 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:42:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1555 backedges. 153 proven. 792 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2022-01-31 10:42:49,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:42:49,853 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 21 treesize of output 19 [2022-01-31 10:42:49,854 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 37 treesize of output 33 [2022-01-31 10:42:50,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1555 backedges. 66 proven. 770 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2022-01-31 10:42:50,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332789958] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:42:50,144 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:42:50,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 74 [2022-01-31 10:42:50,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48486861] [2022-01-31 10:42:50,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:42:50,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-01-31 10:42:50,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:42:50,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-01-31 10:42:50,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=5128, Unknown=0, NotChecked=0, Total=5402 [2022-01-31 10:42:50,154 INFO L87 Difference]: Start difference. First operand 232 states and 236 transitions. Second operand has 74 states, 72 states have (on average 2.736111111111111) internal successors, (197), 67 states have internal predecessors, (197), 56 states have call successors, (63), 5 states have call predecessors, (63), 3 states have return successors, (59), 56 states have call predecessors, (59), 54 states have call successors, (59) [2022-01-31 10:42:52,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:42:52,390 INFO L93 Difference]: Finished difference Result 250 states and 254 transitions. [2022-01-31 10:42:52,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-31 10:42:52,391 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 72 states have (on average 2.736111111111111) internal successors, (197), 67 states have internal predecessors, (197), 56 states have call successors, (63), 5 states have call predecessors, (63), 3 states have return successors, (59), 56 states have call predecessors, (59), 54 states have call successors, (59) Word has length 241 [2022-01-31 10:42:52,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:42:52,391 INFO L225 Difference]: With dead ends: 250 [2022-01-31 10:42:52,391 INFO L226 Difference]: Without dead ends: 250 [2022-01-31 10:42:52,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 488 SyntacticMatches, 37 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5059 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=628, Invalid=12482, Unknown=0, NotChecked=0, Total=13110 [2022-01-31 10:42:52,392 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 226 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 5845 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 6319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 5845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 322 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-31 10:42:52,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 705 Invalid, 6319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 5845 Invalid, 0 Unknown, 322 Unchecked, 1.6s Time] [2022-01-31 10:42:52,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-01-31 10:42:52,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 244. [2022-01-31 10:42:52,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 180 states have (on average 1.011111111111111) internal successors, (182), 181 states have internal predecessors, (182), 33 states have call successors, (33), 31 states have call predecessors, (33), 30 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2022-01-31 10:42:52,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 247 transitions. [2022-01-31 10:42:52,395 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 247 transitions. Word has length 241 [2022-01-31 10:42:52,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:42:52,395 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 247 transitions. [2022-01-31 10:42:52,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 72 states have (on average 2.736111111111111) internal successors, (197), 67 states have internal predecessors, (197), 56 states have call successors, (63), 5 states have call predecessors, (63), 3 states have return successors, (59), 56 states have call predecessors, (59), 54 states have call successors, (59) [2022-01-31 10:42:52,395 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 247 transitions. [2022-01-31 10:42:52,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-01-31 10:42:52,396 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:42:52,396 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 17, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:42:52,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-01-31 10:42:52,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-01-31 10:42:52,597 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:42:52,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:42:52,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1766960638, now seen corresponding path program 46 times [2022-01-31 10:42:52,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:42:52,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705097396] [2022-01-31 10:42:52,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:42:52,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:42:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:42:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:42:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:42:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:42:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:42:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:42:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:42:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:42:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:42:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:42:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:42:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:42:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:42:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:42:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:42:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:42:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:42:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:42:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-31 10:42:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:42:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:42:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:42:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:42:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:42:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:42:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:42:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:42:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:42:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:42:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:42:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:42:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:42:53,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1655 backedges. 71 proven. 818 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2022-01-31 10:42:53,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:42:53,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705097396] [2022-01-31 10:42:53,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705097396] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:42:53,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254511188] [2022-01-31 10:42:53,249 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 10:42:53,249 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:42:53,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:42:53,250 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:42:53,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-01-31 10:42:53,504 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 10:42:53,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:42:53,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 76 conjunts are in the unsatisfiable core [2022-01-31 10:42:53,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:42:54,298 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:42:54,506 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-31 10:42:54,506 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 27 treesize of output 26 [2022-01-31 10:42:58,090 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:42:58,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1655 backedges. 183 proven. 844 refuted. 80 times theorem prover too weak. 548 trivial. 0 not checked. [2022-01-31 10:42:58,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:42:58,539 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 21 treesize of output 19 [2022-01-31 10:42:58,541 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 37 treesize of output 33 [2022-01-31 10:42:58,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1655 backedges. 71 proven. 818 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2022-01-31 10:42:58,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254511188] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:42:58,942 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:42:58,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 40] total 78 [2022-01-31 10:42:58,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476541353] [2022-01-31 10:42:58,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:42:58,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-01-31 10:42:58,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:42:58,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-01-31 10:42:58,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=5701, Unknown=1, NotChecked=0, Total=6006 [2022-01-31 10:42:58,943 INFO L87 Difference]: Start difference. First operand 244 states and 247 transitions. Second operand has 78 states, 76 states have (on average 2.723684210526316) internal successors, (207), 71 states have internal predecessors, (207), 59 states have call successors, (65), 6 states have call predecessors, (65), 4 states have return successors, (61), 59 states have call predecessors, (61), 57 states have call successors, (61) [2022-01-31 10:43:01,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:43:01,307 INFO L93 Difference]: Finished difference Result 370 states and 376 transitions. [2022-01-31 10:43:01,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-01-31 10:43:01,307 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 76 states have (on average 2.723684210526316) internal successors, (207), 71 states have internal predecessors, (207), 59 states have call successors, (65), 6 states have call predecessors, (65), 4 states have return successors, (61), 59 states have call predecessors, (61), 57 states have call successors, (61) Word has length 249 [2022-01-31 10:43:01,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:43:01,308 INFO L225 Difference]: With dead ends: 370 [2022-01-31 10:43:01,308 INFO L226 Difference]: Without dead ends: 370 [2022-01-31 10:43:01,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 490 SyntacticMatches, 37 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5790 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=726, Invalid=14034, Unknown=2, NotChecked=0, Total=14762 [2022-01-31 10:43:01,309 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 134 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 6068 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 6622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 6068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 428 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-31 10:43:01,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 881 Invalid, 6622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 6068 Invalid, 0 Unknown, 428 Unchecked, 1.4s Time] [2022-01-31 10:43:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-01-31 10:43:01,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 261. [2022-01-31 10:43:01,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 193 states have (on average 1.0155440414507773) internal successors, (196), 194 states have internal predecessors, (196), 35 states have call successors, (35), 33 states have call predecessors, (35), 32 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2022-01-31 10:43:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 265 transitions. [2022-01-31 10:43:01,313 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 265 transitions. Word has length 249 [2022-01-31 10:43:01,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:43:01,313 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 265 transitions. [2022-01-31 10:43:01,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 76 states have (on average 2.723684210526316) internal successors, (207), 71 states have internal predecessors, (207), 59 states have call successors, (65), 6 states have call predecessors, (65), 4 states have return successors, (61), 59 states have call predecessors, (61), 57 states have call successors, (61) [2022-01-31 10:43:01,313 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 265 transitions. [2022-01-31 10:43:01,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-01-31 10:43:01,314 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:43:01,314 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 17, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:43:01,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2022-01-31 10:43:01,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-01-31 10:43:01,550 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:43:01,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:43:01,550 INFO L85 PathProgramCache]: Analyzing trace with hash 326672656, now seen corresponding path program 47 times [2022-01-31 10:43:01,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:43:01,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561109862] [2022-01-31 10:43:01,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:43:01,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:43:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:43:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:43:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:43:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:43:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:43:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:43:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:43:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:43:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:43:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:43:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:43:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:43:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:43:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:43:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:43:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:43:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:43:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:43:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-31 10:43:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:43:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:43:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:43:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:43:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:43:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:43:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:43:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:43:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:43:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:43:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:43:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:43:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:43:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:02,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1763 backedges. 76 proven. 869 refuted. 0 times theorem prover too weak. 818 trivial. 0 not checked. [2022-01-31 10:43:02,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:43:02,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561109862] [2022-01-31 10:43:02,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561109862] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:43:02,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520026234] [2022-01-31 10:43:02,556 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 10:43:02,556 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:43:02,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:43:02,557 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:43:02,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-01-31 10:43:02,797 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2022-01-31 10:43:02,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:43:02,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 77 conjunts are in the unsatisfiable core [2022-01-31 10:43:02,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:43:03,577 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 13 treesize of output 9 [2022-01-31 10:43:05,087 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:43:05,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1763 backedges. 48 proven. 897 refuted. 0 times theorem prover too weak. 818 trivial. 0 not checked. [2022-01-31 10:43:05,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:43:05,332 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 16 treesize of output 14 [2022-01-31 10:43:05,337 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 32 treesize of output 28 [2022-01-31 10:43:05,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1763 backedges. 76 proven. 869 refuted. 0 times theorem prover too weak. 818 trivial. 0 not checked. [2022-01-31 10:43:05,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520026234] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:43:05,761 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:43:05,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 41, 40] total 80 [2022-01-31 10:43:05,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419482576] [2022-01-31 10:43:05,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:43:05,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-01-31 10:43:05,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:43:05,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-01-31 10:43:05,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=6041, Unknown=0, NotChecked=0, Total=6320 [2022-01-31 10:43:05,763 INFO L87 Difference]: Start difference. First operand 261 states and 265 transitions. Second operand has 80 states, 77 states have (on average 2.7012987012987013) internal successors, (208), 72 states have internal predecessors, (208), 62 states have call successors, (68), 5 states have call predecessors, (68), 3 states have return successors, (64), 62 states have call predecessors, (64), 60 states have call successors, (64) [2022-01-31 10:43:10,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:43:10,563 INFO L93 Difference]: Finished difference Result 388 states and 396 transitions. [2022-01-31 10:43:10,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-01-31 10:43:10,564 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 77 states have (on average 2.7012987012987013) internal successors, (208), 72 states have internal predecessors, (208), 62 states have call successors, (68), 5 states have call predecessors, (68), 3 states have return successors, (64), 62 states have call predecessors, (64), 60 states have call successors, (64) Word has length 257 [2022-01-31 10:43:10,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:43:10,572 INFO L225 Difference]: With dead ends: 388 [2022-01-31 10:43:10,572 INFO L226 Difference]: Without dead ends: 388 [2022-01-31 10:43:10,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 676 GetRequests, 523 SyntacticMatches, 33 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5451 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=627, Invalid=14133, Unknown=2, NotChecked=0, Total=14762 [2022-01-31 10:43:10,574 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 300 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 11737 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 12554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 11737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 556 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-01-31 10:43:10,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [303 Valid, 1017 Invalid, 12554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 11737 Invalid, 0 Unknown, 556 Unchecked, 3.5s Time] [2022-01-31 10:43:10,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-01-31 10:43:10,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 269. [2022-01-31 10:43:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 199 states have (on average 1.015075376884422) internal successors, (202), 200 states have internal predecessors, (202), 36 states have call successors, (36), 34 states have call predecessors, (36), 33 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-01-31 10:43:10,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 273 transitions. [2022-01-31 10:43:10,594 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 273 transitions. Word has length 257 [2022-01-31 10:43:10,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:43:10,595 INFO L470 AbstractCegarLoop]: Abstraction has 269 states and 273 transitions. [2022-01-31 10:43:10,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 77 states have (on average 2.7012987012987013) internal successors, (208), 72 states have internal predecessors, (208), 62 states have call successors, (68), 5 states have call predecessors, (68), 3 states have return successors, (64), 62 states have call predecessors, (64), 60 states have call successors, (64) [2022-01-31 10:43:10,596 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 273 transitions. [2022-01-31 10:43:10,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-01-31 10:43:10,596 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:43:10,597 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 18, 16, 16, 16, 16, 16, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:43:10,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-01-31 10:43:10,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:43:10,797 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:43:10,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:43:10,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1486256420, now seen corresponding path program 48 times [2022-01-31 10:43:10,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:43:10,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459839359] [2022-01-31 10:43:10,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:43:10,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:43:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:43:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:43:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:43:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:43:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:43:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:43:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:43:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:43:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:43:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:43:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:43:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:43:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:43:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:43:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:43:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:43:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:43:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:43:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 10:43:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:43:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:43:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:43:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:43:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:43:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:43:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:43:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:43:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:43:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:43:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:43:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:43:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:43:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:11,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1784 backedges. 71 proven. 885 refuted. 0 times theorem prover too weak. 828 trivial. 0 not checked. [2022-01-31 10:43:11,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:43:11,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459839359] [2022-01-31 10:43:11,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459839359] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:43:11,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411568976] [2022-01-31 10:43:11,533 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 10:43:11,533 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:43:11,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:43:11,534 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:43:11,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-01-31 10:43:12,108 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-01-31 10:43:12,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:43:12,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 80 conjunts are in the unsatisfiable core [2022-01-31 10:43:12,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:43:13,003 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:43:13,204 INFO L353 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-01-31 10:43:13,204 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 28 treesize of output 27 [2022-01-31 10:43:13,432 INFO L353 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-01-31 10:43:13,432 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 28 treesize of output 27 [2022-01-31 10:43:15,926 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:43:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1784 backedges. 161 proven. 911 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2022-01-31 10:43:16,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:43:16,456 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 21 treesize of output 19 [2022-01-31 10:43:16,458 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 37 treesize of output 33 [2022-01-31 10:43:16,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1784 backedges. 71 proven. 884 refuted. 0 times theorem prover too weak. 829 trivial. 0 not checked. [2022-01-31 10:43:16,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411568976] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:43:16,923 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:43:16,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 79 [2022-01-31 10:43:16,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594404036] [2022-01-31 10:43:16,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:43:16,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-01-31 10:43:16,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:43:16,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-01-31 10:43:16,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=5865, Unknown=0, NotChecked=0, Total=6162 [2022-01-31 10:43:16,924 INFO L87 Difference]: Start difference. First operand 269 states and 273 transitions. Second operand has 79 states, 77 states have (on average 2.7532467532467533) internal successors, (212), 72 states have internal predecessors, (212), 61 states have call successors, (67), 5 states have call predecessors, (67), 3 states have return successors, (63), 61 states have call predecessors, (63), 59 states have call successors, (63) [2022-01-31 10:43:19,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:43:19,841 INFO L93 Difference]: Finished difference Result 348 states and 364 transitions. [2022-01-31 10:43:19,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-01-31 10:43:19,842 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 77 states have (on average 2.7532467532467533) internal successors, (212), 72 states have internal predecessors, (212), 61 states have call successors, (67), 5 states have call predecessors, (67), 3 states have return successors, (63), 61 states have call predecessors, (63), 59 states have call successors, (63) Word has length 257 [2022-01-31 10:43:19,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:43:19,864 INFO L225 Difference]: With dead ends: 348 [2022-01-31 10:43:19,864 INFO L226 Difference]: Without dead ends: 348 [2022-01-31 10:43:19,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 504 SyntacticMatches, 39 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6079 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=694, Invalid=14806, Unknown=0, NotChecked=0, Total=15500 [2022-01-31 10:43:19,866 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 175 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 6967 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 7512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 6967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 368 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-31 10:43:19,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 1053 Invalid, 7512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 6967 Invalid, 0 Unknown, 368 Unchecked, 2.1s Time] [2022-01-31 10:43:19,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-01-31 10:43:19,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 319. [2022-01-31 10:43:19,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 236 states have (on average 1.0127118644067796) internal successors, (239), 238 states have internal predecessors, (239), 48 states have call successors, (48), 35 states have call predecessors, (48), 34 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2022-01-31 10:43:19,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 334 transitions. [2022-01-31 10:43:19,870 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 334 transitions. Word has length 257 [2022-01-31 10:43:19,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:43:19,871 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 334 transitions. [2022-01-31 10:43:19,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 77 states have (on average 2.7532467532467533) internal successors, (212), 72 states have internal predecessors, (212), 61 states have call successors, (67), 5 states have call predecessors, (67), 3 states have return successors, (63), 61 states have call predecessors, (63), 59 states have call successors, (63) [2022-01-31 10:43:19,871 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 334 transitions. [2022-01-31 10:43:19,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2022-01-31 10:43:19,872 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:43:19,872 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:43:19,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-01-31 10:43:20,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-01-31 10:43:20,088 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:43:20,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:43:20,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1714658782, now seen corresponding path program 49 times [2022-01-31 10:43:20,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:43:20,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900561720] [2022-01-31 10:43:20,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:43:20,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:43:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:43:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:43:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:43:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:43:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:43:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:43:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:43:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:43:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:43:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:43:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:43:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:43:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:43:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:43:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:43:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:43:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:43:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:43:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-31 10:43:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:43:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:43:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:43:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:43:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:43:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:43:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:43:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:43:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:43:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:43:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:43:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:43:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:43:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-01-31 10:43:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1879 backedges. 423 proven. 492 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2022-01-31 10:43:20,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:43:20,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900561720] [2022-01-31 10:43:20,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900561720] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:43:20,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083222456] [2022-01-31 10:43:20,555 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 10:43:20,555 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:43:20,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:43:20,572 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:43:20,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-01-31 10:43:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:20,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 34 conjunts are in the unsatisfiable core [2022-01-31 10:43:20,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:43:21,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1879 backedges. 480 proven. 435 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2022-01-31 10:43:21,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:43:21,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1879 backedges. 480 proven. 435 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2022-01-31 10:43:21,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083222456] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:43:21,902 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:43:21,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 54 [2022-01-31 10:43:21,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637460886] [2022-01-31 10:43:21,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:43:21,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-01-31 10:43:21,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:43:21,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-01-31 10:43:21,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=653, Invalid=2209, Unknown=0, NotChecked=0, Total=2862 [2022-01-31 10:43:21,904 INFO L87 Difference]: Start difference. First operand 319 states and 334 transitions. Second operand has 54 states, 54 states have (on average 3.0185185185185186) internal successors, (163), 53 states have internal predecessors, (163), 49 states have call successors, (53), 3 states have call predecessors, (53), 1 states have return successors, (50), 48 states have call predecessors, (50), 48 states have call successors, (50) [2022-01-31 10:43:22,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:43:22,777 INFO L93 Difference]: Finished difference Result 343 states and 362 transitions. [2022-01-31 10:43:22,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-31 10:43:22,777 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 3.0185185185185186) internal successors, (163), 53 states have internal predecessors, (163), 49 states have call successors, (53), 3 states have call predecessors, (53), 1 states have return successors, (50), 48 states have call predecessors, (50), 48 states have call successors, (50) Word has length 265 [2022-01-31 10:43:22,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:43:22,786 INFO L225 Difference]: With dead ends: 343 [2022-01-31 10:43:22,787 INFO L226 Difference]: Without dead ends: 273 [2022-01-31 10:43:22,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 577 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2222 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1612, Invalid=6044, Unknown=0, NotChecked=0, Total=7656 [2022-01-31 10:43:22,787 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 223 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 10:43:22,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 112 Invalid, 1618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 10:43:22,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-01-31 10:43:22,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 260. [2022-01-31 10:43:22,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 192 states have (on average 1.0104166666666667) internal successors, (194), 193 states have internal predecessors, (194), 35 states have call successors, (35), 33 states have call predecessors, (35), 32 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2022-01-31 10:43:22,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 263 transitions. [2022-01-31 10:43:22,790 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 263 transitions. Word has length 265 [2022-01-31 10:43:22,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:43:22,790 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 263 transitions. [2022-01-31 10:43:22,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 3.0185185185185186) internal successors, (163), 53 states have internal predecessors, (163), 49 states have call successors, (53), 3 states have call predecessors, (53), 1 states have return successors, (50), 48 states have call predecessors, (50), 48 states have call successors, (50) [2022-01-31 10:43:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 263 transitions. [2022-01-31 10:43:22,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2022-01-31 10:43:22,792 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:43:22,792 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 18, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:43:22,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-01-31 10:43:22,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:43:22,992 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:43:22,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:43:22,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1685013522, now seen corresponding path program 50 times [2022-01-31 10:43:22,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:43:22,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257206972] [2022-01-31 10:43:22,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:43:22,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:43:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:43:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:43:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:43:23,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:43:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:43:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:43:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:43:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:43:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:43:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:43:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:43:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:43:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:43:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:43:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:43:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:43:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:43:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:43:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 10:43:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:43:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:43:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:43:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:43:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:43:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:43:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:43:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:43:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:43:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:43:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:43:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:43:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:43:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-01-31 10:43:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:23,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 76 proven. 936 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2022-01-31 10:43:23,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:43:23,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257206972] [2022-01-31 10:43:23,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257206972] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:43:23,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153063872] [2022-01-31 10:43:23,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 10:43:23,796 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:43:23,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:43:23,812 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:43:23,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-01-31 10:43:23,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 10:43:23,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:43:23,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 80 conjunts are in the unsatisfiable core [2022-01-31 10:43:24,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:43:24,893 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:43:25,105 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-31 10:43:25,105 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 27 treesize of output 26 [2022-01-31 10:43:28,178 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:43:28,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 210 proven. 964 refuted. 32 times theorem prover too weak. 686 trivial. 0 not checked. [2022-01-31 10:43:28,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:43:28,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 21 treesize of output 19 [2022-01-31 10:43:28,651 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 37 treesize of output 33 [2022-01-31 10:43:29,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 76 proven. 936 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2022-01-31 10:43:29,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153063872] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:43:29,156 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:43:29,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 42] total 82 [2022-01-31 10:43:29,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002648891] [2022-01-31 10:43:29,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:43:29,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-01-31 10:43:29,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:43:29,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-01-31 10:43:29,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=6320, Unknown=1, NotChecked=0, Total=6642 [2022-01-31 10:43:29,157 INFO L87 Difference]: Start difference. First operand 260 states and 263 transitions. Second operand has 82 states, 80 states have (on average 2.7375) internal successors, (219), 75 states have internal predecessors, (219), 63 states have call successors, (69), 6 states have call predecessors, (69), 4 states have return successors, (65), 63 states have call predecessors, (65), 61 states have call successors, (65) [2022-01-31 10:43:31,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:43:31,996 INFO L93 Difference]: Finished difference Result 388 states and 392 transitions. [2022-01-31 10:43:31,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-31 10:43:31,997 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 80 states have (on average 2.7375) internal successors, (219), 75 states have internal predecessors, (219), 63 states have call successors, (69), 6 states have call predecessors, (69), 4 states have return successors, (65), 63 states have call predecessors, (65), 61 states have call successors, (65) Word has length 265 [2022-01-31 10:43:31,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:43:31,998 INFO L225 Difference]: With dead ends: 388 [2022-01-31 10:43:31,998 INFO L226 Difference]: Without dead ends: 388 [2022-01-31 10:43:31,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 697 GetRequests, 534 SyntacticMatches, 39 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6213 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=726, Invalid=15023, Unknown=1, NotChecked=0, Total=15750 [2022-01-31 10:43:31,999 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 164 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 5586 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 5962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 5586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 271 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-31 10:43:31,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 1010 Invalid, 5962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 5586 Invalid, 0 Unknown, 271 Unchecked, 1.9s Time] [2022-01-31 10:43:32,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-01-31 10:43:32,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 277. [2022-01-31 10:43:32,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 205 states have (on average 1.0146341463414634) internal successors, (208), 206 states have internal predecessors, (208), 37 states have call successors, (37), 35 states have call predecessors, (37), 34 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2022-01-31 10:43:32,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 281 transitions. [2022-01-31 10:43:32,003 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 281 transitions. Word has length 265 [2022-01-31 10:43:32,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:43:32,004 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 281 transitions. [2022-01-31 10:43:32,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 80 states have (on average 2.7375) internal successors, (219), 75 states have internal predecessors, (219), 63 states have call successors, (69), 6 states have call predecessors, (69), 4 states have return successors, (65), 63 states have call predecessors, (65), 61 states have call successors, (65) [2022-01-31 10:43:32,004 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 281 transitions. [2022-01-31 10:43:32,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-01-31 10:43:32,005 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:43:32,005 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 18, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:43:32,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-01-31 10:43:32,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-01-31 10:43:32,224 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:43:32,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:43:32,224 INFO L85 PathProgramCache]: Analyzing trace with hash 277004032, now seen corresponding path program 51 times [2022-01-31 10:43:32,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:43:32,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646671667] [2022-01-31 10:43:32,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:43:32,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:43:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:32,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:43:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:32,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:43:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:32,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:43:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:32,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:43:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:32,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:43:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:32,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:43:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:32,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:43:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:32,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:43:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:32,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:43:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:32,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:43:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:32,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:43:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:32,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:43:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:32,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:43:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:32,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:43:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:32,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:43:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:32,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:43:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:32,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:43:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:32,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:43:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:32,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 10:43:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:32,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:43:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:32,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:43:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:32,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:43:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:32,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:43:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:33,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:43:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:33,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:43:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:33,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:43:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:33,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:43:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:33,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:43:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:33,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:43:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:33,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:43:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:33,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:43:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:33,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:43:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:33,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-01-31 10:43:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:33,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-01-31 10:43:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:33,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2008 backedges. 81 proven. 991 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2022-01-31 10:43:33,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:43:33,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646671667] [2022-01-31 10:43:33,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646671667] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:43:33,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449474294] [2022-01-31 10:43:33,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 10:43:33,021 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:43:33,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:43:33,022 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:43:33,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-01-31 10:43:33,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2022-01-31 10:43:33,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:43:33,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 84 conjunts are in the unsatisfiable core [2022-01-31 10:43:33,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:43:34,816 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:43:50,437 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-01-31 10:43:50,437 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-01-31 10:43:50,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2008 backedges. 51 proven. 1021 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2022-01-31 10:43:50,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:43:53,872 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 16 treesize of output 14 [2022-01-31 10:43:53,874 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-01-31 10:43:53,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449474294] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:43:53,995 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 10:43:53,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 85 [2022-01-31 10:43:53,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725960176] [2022-01-31 10:43:53,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 10:43:53,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-01-31 10:43:53,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:43:53,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-01-31 10:43:53,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=759, Invalid=10369, Unknown=2, NotChecked=0, Total=11130 [2022-01-31 10:43:53,997 INFO L87 Difference]: Start difference. First operand 277 states and 281 transitions. Second operand has 85 states, 82 states have (on average 2.6341463414634148) internal successors, (216), 78 states have internal predecessors, (216), 65 states have call successors, (69), 5 states have call predecessors, (69), 3 states have return successors, (66), 65 states have call predecessors, (66), 63 states have call successors, (66) [2022-01-31 10:43:55,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:43:55,626 INFO L93 Difference]: Finished difference Result 397 states and 402 transitions. [2022-01-31 10:43:55,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-01-31 10:43:55,627 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 82 states have (on average 2.6341463414634148) internal successors, (216), 78 states have internal predecessors, (216), 65 states have call successors, (69), 5 states have call predecessors, (69), 3 states have return successors, (66), 65 states have call predecessors, (66), 63 states have call successors, (66) Word has length 273 [2022-01-31 10:43:55,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:43:55,628 INFO L225 Difference]: With dead ends: 397 [2022-01-31 10:43:55,628 INFO L226 Difference]: Without dead ends: 397 [2022-01-31 10:43:55,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 379 SyntacticMatches, 31 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6381 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=1041, Invalid=16249, Unknown=2, NotChecked=0, Total=17292 [2022-01-31 10:43:55,629 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 155 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 4050 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 4886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 4050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 710 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 10:43:55,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 1018 Invalid, 4886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 4050 Invalid, 0 Unknown, 710 Unchecked, 1.0s Time] [2022-01-31 10:43:55,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-01-31 10:43:55,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 285. [2022-01-31 10:43:55,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 211 states have (on average 1.014218009478673) internal successors, (214), 212 states have internal predecessors, (214), 38 states have call successors, (38), 36 states have call predecessors, (38), 35 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-01-31 10:43:55,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 289 transitions. [2022-01-31 10:43:55,632 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 289 transitions. Word has length 273 [2022-01-31 10:43:55,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:43:55,632 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 289 transitions. [2022-01-31 10:43:55,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 82 states have (on average 2.6341463414634148) internal successors, (216), 78 states have internal predecessors, (216), 65 states have call successors, (69), 5 states have call predecessors, (69), 3 states have return successors, (66), 65 states have call predecessors, (66), 63 states have call successors, (66) [2022-01-31 10:43:55,632 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 289 transitions. [2022-01-31 10:43:55,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-01-31 10:43:55,633 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:43:55,633 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 19, 17, 17, 17, 17, 17, 15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:43:55,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-01-31 10:43:55,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-01-31 10:43:55,851 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:43:55,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:43:55,852 INFO L85 PathProgramCache]: Analyzing trace with hash 306649292, now seen corresponding path program 52 times [2022-01-31 10:43:55,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:43:55,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763123043] [2022-01-31 10:43:55,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:43:55,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:43:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:43:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:43:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:43:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:43:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:43:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:43:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:43:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:43:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:43:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:43:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:43:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:43:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:43:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:43:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:43:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:43:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:43:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:43:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 10:43:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-31 10:43:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:43:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:43:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:43:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:43:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:43:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:43:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:43:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:43:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:43:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:43:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:43:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:43:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-01-31 10:43:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-01-31 10:43:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:43:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2029 backedges. 76 proven. 1007 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-01-31 10:43:56,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:43:56,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763123043] [2022-01-31 10:43:56,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763123043] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:43:56,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818571113] [2022-01-31 10:43:56,605 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 10:43:56,606 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:43:56,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:43:56,606 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:43:56,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-01-31 10:43:56,878 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 10:43:56,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:43:56,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 83 conjunts are in the unsatisfiable core [2022-01-31 10:43:56,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:43:57,606 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:43:57,693 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:43:57,693 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:43:57,819 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:43:57,820 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:43:59,362 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:43:59,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2029 backedges. 175 proven. 1032 refuted. 0 times theorem prover too weak. 822 trivial. 0 not checked. [2022-01-31 10:43:59,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:43:59,757 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 21 treesize of output 19 [2022-01-31 10:43:59,759 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 37 treesize of output 33 [2022-01-31 10:44:00,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2029 backedges. 76 proven. 1006 refuted. 0 times theorem prover too weak. 947 trivial. 0 not checked. [2022-01-31 10:44:00,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818571113] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:44:00,215 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:44:00,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 82 [2022-01-31 10:44:00,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996275396] [2022-01-31 10:44:00,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:44:00,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-01-31 10:44:00,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:44:00,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-01-31 10:44:00,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=6336, Unknown=0, NotChecked=0, Total=6642 [2022-01-31 10:44:00,217 INFO L87 Difference]: Start difference. First operand 285 states and 289 transitions. Second operand has 82 states, 80 states have (on average 2.7625) internal successors, (221), 75 states have internal predecessors, (221), 64 states have call successors, (71), 5 states have call predecessors, (71), 3 states have return successors, (67), 64 states have call predecessors, (67), 62 states have call successors, (67) [2022-01-31 10:44:02,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:44:02,578 INFO L93 Difference]: Finished difference Result 361 states and 378 transitions. [2022-01-31 10:44:02,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-01-31 10:44:02,579 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 80 states have (on average 2.7625) internal successors, (221), 75 states have internal predecessors, (221), 64 states have call successors, (71), 5 states have call predecessors, (71), 3 states have return successors, (67), 64 states have call predecessors, (67), 62 states have call successors, (67) Word has length 273 [2022-01-31 10:44:02,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:44:02,580 INFO L225 Difference]: With dead ends: 361 [2022-01-31 10:44:02,580 INFO L226 Difference]: Without dead ends: 361 [2022-01-31 10:44:02,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 702 GetRequests, 536 SyntacticMatches, 41 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6284 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=694, Invalid=15308, Unknown=0, NotChecked=0, Total=16002 [2022-01-31 10:44:02,587 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 186 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 6438 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 6889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 6438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 257 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-31 10:44:02,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 624 Invalid, 6889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 6438 Invalid, 0 Unknown, 257 Unchecked, 1.7s Time] [2022-01-31 10:44:02,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-01-31 10:44:02,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 339. [2022-01-31 10:44:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 251 states have (on average 1.0119521912350598) internal successors, (254), 253 states have internal predecessors, (254), 51 states have call successors, (51), 37 states have call predecessors, (51), 36 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2022-01-31 10:44:02,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 355 transitions. [2022-01-31 10:44:02,591 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 355 transitions. Word has length 273 [2022-01-31 10:44:02,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:44:02,591 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 355 transitions. [2022-01-31 10:44:02,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 80 states have (on average 2.7625) internal successors, (221), 75 states have internal predecessors, (221), 64 states have call successors, (71), 5 states have call predecessors, (71), 3 states have return successors, (67), 64 states have call predecessors, (67), 62 states have call successors, (67) [2022-01-31 10:44:02,591 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 355 transitions. [2022-01-31 10:44:02,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2022-01-31 10:44:02,592 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:44:02,592 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:44:02,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-01-31 10:44:02,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:44:02,807 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:44:02,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:44:02,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1382969326, now seen corresponding path program 53 times [2022-01-31 10:44:02,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:44:02,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405021213] [2022-01-31 10:44:02,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:44:02,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:44:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:44:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:44:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:44:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:44:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:44:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:44:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:44:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:44:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:44:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:44:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:44:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:44:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:44:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:44:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:44:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:44:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:44:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:44:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 10:44:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-31 10:44:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:44:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:44:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:44:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:44:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:44:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:44:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:44:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:44:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:44:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:44:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:44:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:44:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-01-31 10:44:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-01-31 10:44:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-01-31 10:44:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2132 backedges. 483 proven. 557 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2022-01-31 10:44:03,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:44:03,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405021213] [2022-01-31 10:44:03,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405021213] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:44:03,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261260849] [2022-01-31 10:44:03,298 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 10:44:03,298 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:44:03,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:44:03,299 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:44:03,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-01-31 10:44:03,599 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2022-01-31 10:44:03,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:44:03,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-31 10:44:03,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:44:04,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2132 backedges. 544 proven. 496 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2022-01-31 10:44:04,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:44:04,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2132 backedges. 544 proven. 496 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2022-01-31 10:44:04,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261260849] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:44:04,818 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:44:04,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 57 [2022-01-31 10:44:04,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385766867] [2022-01-31 10:44:04,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:44:04,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-01-31 10:44:04,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:44:04,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-01-31 10:44:04,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=727, Invalid=2465, Unknown=0, NotChecked=0, Total=3192 [2022-01-31 10:44:04,820 INFO L87 Difference]: Start difference. First operand 339 states and 355 transitions. Second operand has 57 states, 57 states have (on average 3.017543859649123) internal successors, (172), 56 states have internal predecessors, (172), 52 states have call successors, (56), 3 states have call predecessors, (56), 1 states have return successors, (53), 51 states have call predecessors, (53), 51 states have call successors, (53) [2022-01-31 10:44:05,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:44:05,688 INFO L93 Difference]: Finished difference Result 363 states and 383 transitions. [2022-01-31 10:44:05,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-01-31 10:44:05,688 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 3.017543859649123) internal successors, (172), 56 states have internal predecessors, (172), 52 states have call successors, (56), 3 states have call predecessors, (56), 1 states have return successors, (53), 51 states have call predecessors, (53), 51 states have call successors, (53) Word has length 281 [2022-01-31 10:44:05,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:44:05,703 INFO L225 Difference]: With dead ends: 363 [2022-01-31 10:44:05,703 INFO L226 Difference]: Without dead ends: 289 [2022-01-31 10:44:05,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 704 GetRequests, 612 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2489 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1796, Invalid=6760, Unknown=0, NotChecked=0, Total=8556 [2022-01-31 10:44:05,705 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 249 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 10:44:05,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 114 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 1351 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 10:44:05,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-01-31 10:44:05,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 276. [2022-01-31 10:44:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 204 states have (on average 1.0098039215686274) internal successors, (206), 205 states have internal predecessors, (206), 37 states have call successors, (37), 35 states have call predecessors, (37), 34 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2022-01-31 10:44:05,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 279 transitions. [2022-01-31 10:44:05,708 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 279 transitions. Word has length 281 [2022-01-31 10:44:05,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:44:05,708 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 279 transitions. [2022-01-31 10:44:05,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 3.017543859649123) internal successors, (172), 56 states have internal predecessors, (172), 52 states have call successors, (56), 3 states have call predecessors, (56), 1 states have return successors, (53), 51 states have call predecessors, (53), 51 states have call successors, (53) [2022-01-31 10:44:05,708 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 279 transitions. [2022-01-31 10:44:05,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2022-01-31 10:44:05,709 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:44:05,709 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 19, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:44:05,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2022-01-31 10:44:05,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:44:05,910 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:44:05,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:44:05,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1670029858, now seen corresponding path program 54 times [2022-01-31 10:44:05,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:44:05,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550739783] [2022-01-31 10:44:05,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:44:05,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:44:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:44:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:44:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:44:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:44:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:44:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:44:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:44:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:44:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:44:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:44:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:44:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:44:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:44:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:44:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:44:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:44:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:44:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:44:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 10:44:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-31 10:44:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:44:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:44:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:44:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:44:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:44:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:44:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:44:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:44:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:44:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:44:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:44:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:44:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-01-31 10:44:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-01-31 10:44:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-01-31 10:44:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:06,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 81 proven. 1062 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2022-01-31 10:44:06,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:44:06,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550739783] [2022-01-31 10:44:06,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550739783] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:44:06,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986335684] [2022-01-31 10:44:06,587 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 10:44:06,587 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:44:06,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:44:06,588 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:44:06,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-01-31 10:44:07,419 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-01-31 10:44:07,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:44:07,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 84 conjunts are in the unsatisfiable core [2022-01-31 10:44:07,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:44:08,479 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:44:08,722 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-31 10:44:08,722 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 27 treesize of output 26 [2022-01-31 10:44:10,934 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:44:11,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 117 proven. 1092 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2022-01-31 10:44:11,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:44:11,359 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 21 treesize of output 19 [2022-01-31 10:44:11,361 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 37 treesize of output 33 [2022-01-31 10:44:11,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 81 proven. 1062 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2022-01-31 10:44:11,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986335684] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:44:11,899 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:44:11,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44, 44] total 85 [2022-01-31 10:44:11,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683357002] [2022-01-31 10:44:11,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:44:11,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-01-31 10:44:11,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:44:11,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-01-31 10:44:11,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=6825, Unknown=0, NotChecked=0, Total=7140 [2022-01-31 10:44:11,901 INFO L87 Difference]: Start difference. First operand 276 states and 279 transitions. Second operand has 85 states, 83 states have (on average 2.746987951807229) internal successors, (228), 78 states have internal predecessors, (228), 67 states have call successors, (73), 5 states have call predecessors, (73), 3 states have return successors, (69), 67 states have call predecessors, (69), 65 states have call successors, (69) [2022-01-31 10:44:15,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:44:15,149 INFO L93 Difference]: Finished difference Result 418 states and 424 transitions. [2022-01-31 10:44:15,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-01-31 10:44:15,150 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 83 states have (on average 2.746987951807229) internal successors, (228), 78 states have internal predecessors, (228), 67 states have call successors, (73), 5 states have call predecessors, (73), 3 states have return successors, (69), 67 states have call predecessors, (69), 65 states have call successors, (69) Word has length 281 [2022-01-31 10:44:15,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:44:15,151 INFO L225 Difference]: With dead ends: 418 [2022-01-31 10:44:15,151 INFO L226 Difference]: Without dead ends: 418 [2022-01-31 10:44:15,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 554 SyntacticMatches, 40 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6731 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=726, Invalid=16566, Unknown=0, NotChecked=0, Total=17292 [2022-01-31 10:44:15,152 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 207 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 6694 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 7150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 6694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 267 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-31 10:44:15,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 839 Invalid, 7150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 6694 Invalid, 0 Unknown, 267 Unchecked, 2.2s Time] [2022-01-31 10:44:15,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-01-31 10:44:15,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 293. [2022-01-31 10:44:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 217 states have (on average 1.0138248847926268) internal successors, (220), 218 states have internal predecessors, (220), 39 states have call successors, (39), 37 states have call predecessors, (39), 36 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2022-01-31 10:44:15,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 297 transitions. [2022-01-31 10:44:15,164 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 297 transitions. Word has length 281 [2022-01-31 10:44:15,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:44:15,164 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 297 transitions. [2022-01-31 10:44:15,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 83 states have (on average 2.746987951807229) internal successors, (228), 78 states have internal predecessors, (228), 67 states have call successors, (73), 5 states have call predecessors, (73), 3 states have return successors, (69), 67 states have call predecessors, (69), 65 states have call successors, (69) [2022-01-31 10:44:15,165 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 297 transitions. [2022-01-31 10:44:15,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2022-01-31 10:44:15,166 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:44:15,166 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 19, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:44:15,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-01-31 10:44:15,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:44:15,383 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:44:15,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:44:15,384 INFO L85 PathProgramCache]: Analyzing trace with hash -144805648, now seen corresponding path program 55 times [2022-01-31 10:44:15,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:44:15,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058419329] [2022-01-31 10:44:15,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:44:15,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:44:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:44:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:44:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:44:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:44:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:44:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:44:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:44:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:44:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:44:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:44:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:44:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:44:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:44:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:44:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:44:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:44:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:44:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:44:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 10:44:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-31 10:44:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:44:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:44:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:44:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:44:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:44:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:44:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:44:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:44:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:44:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:44:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:44:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:44:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-01-31 10:44:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-01-31 10:44:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-01-31 10:44:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-01-31 10:44:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2269 backedges. 86 proven. 1121 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2022-01-31 10:44:16,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:44:16,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058419329] [2022-01-31 10:44:16,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058419329] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:44:16,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694650335] [2022-01-31 10:44:16,221 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 10:44:16,221 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:44:16,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:44:16,222 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:44:16,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-01-31 10:44:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:16,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 85 conjunts are in the unsatisfiable core [2022-01-31 10:44:16,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:44:17,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 13 treesize of output 9 [2022-01-31 10:44:19,435 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:44:19,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2269 backedges. 54 proven. 1153 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2022-01-31 10:44:19,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:44:19,877 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 16 treesize of output 14 [2022-01-31 10:44:19,879 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 32 treesize of output 28 [2022-01-31 10:44:20,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2269 backedges. 86 proven. 1121 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2022-01-31 10:44:20,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694650335] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:44:20,347 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:44:20,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 44] total 86 [2022-01-31 10:44:20,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806438620] [2022-01-31 10:44:20,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:44:20,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-01-31 10:44:20,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:44:20,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-01-31 10:44:20,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=7010, Unknown=0, NotChecked=0, Total=7310 [2022-01-31 10:44:20,349 INFO L87 Difference]: Start difference. First operand 293 states and 297 transitions. Second operand has 86 states, 84 states have (on average 2.75) internal successors, (231), 79 states have internal predecessors, (231), 69 states have call successors, (75), 5 states have call predecessors, (75), 3 states have return successors, (71), 69 states have call predecessors, (71), 67 states have call successors, (71) [2022-01-31 10:44:24,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:44:24,510 INFO L93 Difference]: Finished difference Result 437 states and 445 transitions. [2022-01-31 10:44:24,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-01-31 10:44:24,510 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 84 states have (on average 2.75) internal successors, (231), 79 states have internal predecessors, (231), 69 states have call successors, (75), 5 states have call predecessors, (75), 3 states have return successors, (71), 69 states have call predecessors, (71), 67 states have call successors, (71) Word has length 289 [2022-01-31 10:44:24,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:44:24,511 INFO L225 Difference]: With dead ends: 437 [2022-01-31 10:44:24,511 INFO L226 Difference]: Without dead ends: 437 [2022-01-31 10:44:24,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 574 SyntacticMatches, 37 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6653 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=704, Invalid=16852, Unknown=0, NotChecked=0, Total=17556 [2022-01-31 10:44:24,512 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 349 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 12103 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 12786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 12103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 324 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-01-31 10:44:24,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [351 Valid, 884 Invalid, 12786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 12103 Invalid, 0 Unknown, 324 Unchecked, 3.3s Time] [2022-01-31 10:44:24,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-01-31 10:44:24,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 301. [2022-01-31 10:44:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 223 states have (on average 1.0134529147982063) internal successors, (226), 224 states have internal predecessors, (226), 40 states have call successors, (40), 38 states have call predecessors, (40), 37 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2022-01-31 10:44:24,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 305 transitions. [2022-01-31 10:44:24,516 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 305 transitions. Word has length 289 [2022-01-31 10:44:24,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:44:24,516 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 305 transitions. [2022-01-31 10:44:24,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 84 states have (on average 2.75) internal successors, (231), 79 states have internal predecessors, (231), 69 states have call successors, (75), 5 states have call predecessors, (75), 3 states have return successors, (71), 69 states have call predecessors, (71), 67 states have call successors, (71) [2022-01-31 10:44:24,516 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 305 transitions. [2022-01-31 10:44:24,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2022-01-31 10:44:24,517 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:44:24,517 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 18, 18, 18, 18, 18, 16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:44:24,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2022-01-31 10:44:24,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-01-31 10:44:24,732 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:44:24,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:44:24,732 INFO L85 PathProgramCache]: Analyzing trace with hash -431866180, now seen corresponding path program 56 times [2022-01-31 10:44:24,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:44:24,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987131000] [2022-01-31 10:44:24,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:44:24,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:44:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:44:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:44:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:44:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:44:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:44:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:44:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:44:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:44:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:44:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:44:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:44:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:44:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:44:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:44:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:44:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:44:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:44:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:44:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 10:44:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-31 10:44:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-01-31 10:44:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:44:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:44:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:44:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:44:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:44:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:44:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:44:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:44:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:44:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:44:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:44:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-01-31 10:44:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-01-31 10:44:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-01-31 10:44:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-01-31 10:44:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:25,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2290 backedges. 81 proven. 1137 refuted. 0 times theorem prover too weak. 1072 trivial. 0 not checked. [2022-01-31 10:44:25,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:44:25,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987131000] [2022-01-31 10:44:25,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987131000] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:44:25,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547022278] [2022-01-31 10:44:25,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 10:44:25,677 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:44:25,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:44:25,678 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:44:25,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-01-31 10:44:25,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 10:44:25,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:44:25,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 87 conjunts are in the unsatisfiable core [2022-01-31 10:44:25,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:44:26,746 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:44:26,829 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:44:26,830 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:44:26,936 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:44:26,937 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:44:28,509 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:44:28,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2290 backedges. 186 proven. 1164 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2022-01-31 10:44:28,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:44:28,886 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 21 treesize of output 19 [2022-01-31 10:44:28,888 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 37 treesize of output 33 [2022-01-31 10:44:29,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2290 backedges. 81 proven. 1136 refuted. 0 times theorem prover too weak. 1073 trivial. 0 not checked. [2022-01-31 10:44:29,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547022278] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:44:29,198 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:44:29,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 45] total 86 [2022-01-31 10:44:29,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932458561] [2022-01-31 10:44:29,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:44:29,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-01-31 10:44:29,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:44:29,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-01-31 10:44:29,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=6988, Unknown=0, NotChecked=0, Total=7310 [2022-01-31 10:44:29,200 INFO L87 Difference]: Start difference. First operand 301 states and 305 transitions. Second operand has 86 states, 84 states have (on average 2.7738095238095237) internal successors, (233), 79 states have internal predecessors, (233), 68 states have call successors, (75), 5 states have call predecessors, (75), 3 states have return successors, (71), 68 states have call predecessors, (71), 66 states have call successors, (71) [2022-01-31 10:44:31,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:44:31,446 INFO L93 Difference]: Finished difference Result 381 states and 399 transitions. [2022-01-31 10:44:31,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-01-31 10:44:31,446 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 84 states have (on average 2.7738095238095237) internal successors, (233), 79 states have internal predecessors, (233), 68 states have call successors, (75), 5 states have call predecessors, (75), 3 states have return successors, (71), 68 states have call predecessors, (71), 66 states have call successors, (71) Word has length 289 [2022-01-31 10:44:31,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:44:31,447 INFO L225 Difference]: With dead ends: 381 [2022-01-31 10:44:31,447 INFO L226 Difference]: Without dead ends: 381 [2022-01-31 10:44:31,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 583 SyntacticMatches, 43 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6946 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=727, Invalid=16829, Unknown=0, NotChecked=0, Total=17556 [2022-01-31 10:44:31,448 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 230 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 7064 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 7550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 7064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 295 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-31 10:44:31,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 924 Invalid, 7550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 7064 Invalid, 0 Unknown, 295 Unchecked, 1.6s Time] [2022-01-31 10:44:31,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-01-31 10:44:31,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 359. [2022-01-31 10:44:31,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 266 states have (on average 1.0112781954887218) internal successors, (269), 268 states have internal predecessors, (269), 54 states have call successors, (54), 39 states have call predecessors, (54), 38 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2022-01-31 10:44:31,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 376 transitions. [2022-01-31 10:44:31,452 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 376 transitions. Word has length 289 [2022-01-31 10:44:31,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:44:31,452 INFO L470 AbstractCegarLoop]: Abstraction has 359 states and 376 transitions. [2022-01-31 10:44:31,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 84 states have (on average 2.7738095238095237) internal successors, (233), 79 states have internal predecessors, (233), 68 states have call successors, (75), 5 states have call predecessors, (75), 3 states have return successors, (71), 68 states have call predecessors, (71), 66 states have call successors, (71) [2022-01-31 10:44:31,452 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 376 transitions. [2022-01-31 10:44:31,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-01-31 10:44:31,453 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:44:31,453 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:44:31,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-01-31 10:44:31,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-01-31 10:44:31,669 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:44:31,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:44:31,669 INFO L85 PathProgramCache]: Analyzing trace with hash -632008190, now seen corresponding path program 57 times [2022-01-31 10:44:31,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:44:31,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155437876] [2022-01-31 10:44:31,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:44:31,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:44:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:44:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:44:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:44:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:44:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:44:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:44:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:44:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:44:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:44:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:44:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:44:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:44:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:44:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:44:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:44:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:44:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:44:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:44:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 10:44:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-31 10:44:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-31 10:44:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:44:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:44:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:44:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:44:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:44:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:44:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:44:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:44:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:44:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:44:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:44:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-01-31 10:44:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-01-31 10:44:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-01-31 10:44:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-01-31 10:44:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-01-31 10:44:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:32,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 547 proven. 626 refuted. 0 times theorem prover too weak. 1228 trivial. 0 not checked. [2022-01-31 10:44:32,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:44:32,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155437876] [2022-01-31 10:44:32,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155437876] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:44:32,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132403173] [2022-01-31 10:44:32,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 10:44:32,158 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:44:32,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:44:32,159 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:44:32,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-01-31 10:44:32,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2022-01-31 10:44:32,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:44:32,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-31 10:44:32,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:44:33,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 612 proven. 561 refuted. 0 times theorem prover too weak. 1228 trivial. 0 not checked. [2022-01-31 10:44:33,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:44:34,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 612 proven. 561 refuted. 0 times theorem prover too weak. 1228 trivial. 0 not checked. [2022-01-31 10:44:34,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132403173] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:44:34,262 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:44:34,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 60 [2022-01-31 10:44:34,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706306612] [2022-01-31 10:44:34,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:44:34,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-01-31 10:44:34,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:44:34,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-01-31 10:44:34,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=805, Invalid=2735, Unknown=0, NotChecked=0, Total=3540 [2022-01-31 10:44:34,264 INFO L87 Difference]: Start difference. First operand 359 states and 376 transitions. Second operand has 60 states, 60 states have (on average 3.0166666666666666) internal successors, (181), 59 states have internal predecessors, (181), 55 states have call successors, (59), 3 states have call predecessors, (59), 1 states have return successors, (56), 54 states have call predecessors, (56), 54 states have call successors, (56) [2022-01-31 10:44:35,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:44:35,033 INFO L93 Difference]: Finished difference Result 383 states and 404 transitions. [2022-01-31 10:44:35,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-31 10:44:35,033 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 3.0166666666666666) internal successors, (181), 59 states have internal predecessors, (181), 55 states have call successors, (59), 3 states have call predecessors, (59), 1 states have return successors, (56), 54 states have call predecessors, (56), 54 states have call successors, (56) Word has length 297 [2022-01-31 10:44:35,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:44:35,034 INFO L225 Difference]: With dead ends: 383 [2022-01-31 10:44:35,034 INFO L226 Difference]: Without dead ends: 305 [2022-01-31 10:44:35,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 647 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2771 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1990, Invalid=7516, Unknown=0, NotChecked=0, Total=9506 [2022-01-31 10:44:35,035 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 260 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1808 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 1808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 10:44:35,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 141 Invalid, 2127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 1808 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 10:44:35,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-01-31 10:44:35,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 292. [2022-01-31 10:44:35,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 216 states have (on average 1.0092592592592593) internal successors, (218), 217 states have internal predecessors, (218), 39 states have call successors, (39), 37 states have call predecessors, (39), 36 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2022-01-31 10:44:35,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 295 transitions. [2022-01-31 10:44:35,039 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 295 transitions. Word has length 297 [2022-01-31 10:44:35,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:44:35,039 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 295 transitions. [2022-01-31 10:44:35,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 3.0166666666666666) internal successors, (181), 59 states have internal predecessors, (181), 55 states have call successors, (59), 3 states have call predecessors, (59), 1 states have return successors, (56), 54 states have call predecessors, (56), 54 states have call successors, (56) [2022-01-31 10:44:35,039 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 295 transitions. [2022-01-31 10:44:35,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-01-31 10:44:35,040 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:44:35,040 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:44:35,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2022-01-31 10:44:35,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:44:35,259 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:44:35,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:44:35,260 INFO L85 PathProgramCache]: Analyzing trace with hash 698586062, now seen corresponding path program 58 times [2022-01-31 10:44:35,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:44:35,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874508571] [2022-01-31 10:44:35,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:44:35,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:44:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:44:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:44:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:44:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:44:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:44:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:44:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:44:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:44:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:44:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:44:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:44:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:44:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:44:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:44:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:44:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:44:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:44:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:44:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 10:44:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-31 10:44:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-01-31 10:44:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:44:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:44:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:44:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:44:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:44:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:44:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:44:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:44:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:44:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:44:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:44:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-01-31 10:44:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-01-31 10:44:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-01-31 10:44:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-01-31 10:44:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-01-31 10:44:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:35,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2414 backedges. 86 proven. 1196 refuted. 0 times theorem prover too weak. 1132 trivial. 0 not checked. [2022-01-31 10:44:35,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:44:35,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874508571] [2022-01-31 10:44:35,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874508571] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:44:35,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042800153] [2022-01-31 10:44:35,996 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 10:44:35,996 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:44:35,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:44:35,997 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:44:35,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-01-31 10:44:36,332 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 10:44:36,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:44:36,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 88 conjunts are in the unsatisfiable core [2022-01-31 10:44:36,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:44:37,528 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:44:39,787 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-31 10:44:39,788 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 27 treesize of output 26 [2022-01-31 10:44:43,488 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:44:43,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2414 backedges. 180 proven. 1228 refuted. 56 times theorem prover too weak. 950 trivial. 0 not checked. [2022-01-31 10:44:43,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:44:44,025 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 21 treesize of output 19 [2022-01-31 10:44:44,027 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 37 treesize of output 33 [2022-01-31 10:44:44,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2414 backedges. 86 proven. 1196 refuted. 0 times theorem prover too weak. 1132 trivial. 0 not checked. [2022-01-31 10:44:44,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042800153] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:44:44,525 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:44:44,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 46] total 90 [2022-01-31 10:44:44,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004470029] [2022-01-31 10:44:44,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:44:44,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-01-31 10:44:44,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:44:44,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-01-31 10:44:44,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=7653, Unknown=2, NotChecked=0, Total=8010 [2022-01-31 10:44:44,527 INFO L87 Difference]: Start difference. First operand 292 states and 295 transitions. Second operand has 90 states, 88 states have (on average 2.7613636363636362) internal successors, (243), 83 states have internal predecessors, (243), 71 states have call successors, (77), 6 states have call predecessors, (77), 4 states have return successors, (73), 71 states have call predecessors, (73), 69 states have call successors, (73) [2022-01-31 10:44:47,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:44:47,315 INFO L93 Difference]: Finished difference Result 438 states and 443 transitions. [2022-01-31 10:44:47,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-01-31 10:44:47,316 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 88 states have (on average 2.7613636363636362) internal successors, (243), 83 states have internal predecessors, (243), 71 states have call successors, (77), 6 states have call predecessors, (77), 4 states have return successors, (73), 71 states have call predecessors, (73), 69 states have call successors, (73) Word has length 297 [2022-01-31 10:44:47,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:44:47,317 INFO L225 Difference]: With dead ends: 438 [2022-01-31 10:44:47,317 INFO L226 Difference]: Without dead ends: 438 [2022-01-31 10:44:47,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 781 GetRequests, 602 SyntacticMatches, 42 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7605 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=824, Invalid=18355, Unknown=3, NotChecked=0, Total=19182 [2022-01-31 10:44:47,318 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 251 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 6264 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 6725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 6264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 308 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-31 10:44:47,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 840 Invalid, 6725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 6264 Invalid, 0 Unknown, 308 Unchecked, 1.7s Time] [2022-01-31 10:44:47,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-01-31 10:44:47,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 309. [2022-01-31 10:44:47,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 229 states have (on average 1.0131004366812226) internal successors, (232), 230 states have internal predecessors, (232), 41 states have call successors, (41), 39 states have call predecessors, (41), 38 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-01-31 10:44:47,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 313 transitions. [2022-01-31 10:44:47,322 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 313 transitions. Word has length 297 [2022-01-31 10:44:47,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:44:47,322 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 313 transitions. [2022-01-31 10:44:47,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 88 states have (on average 2.7613636363636362) internal successors, (243), 83 states have internal predecessors, (243), 71 states have call successors, (77), 6 states have call predecessors, (77), 4 states have return successors, (73), 71 states have call predecessors, (73), 69 states have call successors, (73) [2022-01-31 10:44:47,323 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 313 transitions. [2022-01-31 10:44:47,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2022-01-31 10:44:47,324 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:44:47,324 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:44:47,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2022-01-31 10:44:47,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:44:47,538 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:44:47,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:44:47,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1582319904, now seen corresponding path program 59 times [2022-01-31 10:44:47,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:44:47,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128806617] [2022-01-31 10:44:47,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:44:47,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:44:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:44:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:44:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:44:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:44:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:44:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:44:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:44:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:44:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:44:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:44:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:44:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:44:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:44:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:44:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:44:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:44:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:44:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:44:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 10:44:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-31 10:44:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-01-31 10:44:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:44:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:44:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:44:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:44:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:44:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:44:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:44:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:44:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:44:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:44:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:44:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-01-31 10:44:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-01-31 10:44:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-01-31 10:44:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-01-31 10:44:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-01-31 10:44:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-01-31 10:44:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:48,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2546 backedges. 91 proven. 1259 refuted. 0 times theorem prover too weak. 1196 trivial. 0 not checked. [2022-01-31 10:44:48,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:44:48,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128806617] [2022-01-31 10:44:48,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128806617] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:44:48,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945532856] [2022-01-31 10:44:48,338 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 10:44:48,338 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:44:48,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:44:48,339 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:44:48,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-01-31 10:44:48,652 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2022-01-31 10:44:48,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:44:48,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 89 conjunts are in the unsatisfiable core [2022-01-31 10:44:48,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:44:49,685 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 13 treesize of output 9 [2022-01-31 10:44:51,703 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:44:51,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2546 backedges. 57 proven. 1293 refuted. 0 times theorem prover too weak. 1196 trivial. 0 not checked. [2022-01-31 10:44:51,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:44:51,993 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 16 treesize of output 14 [2022-01-31 10:44:51,994 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 32 treesize of output 28 [2022-01-31 10:44:52,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2546 backedges. 91 proven. 1259 refuted. 0 times theorem prover too weak. 1196 trivial. 0 not checked. [2022-01-31 10:44:52,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945532856] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:44:52,330 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:44:52,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 46] total 90 [2022-01-31 10:44:52,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595084839] [2022-01-31 10:44:52,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:44:52,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-01-31 10:44:52,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:44:52,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-01-31 10:44:52,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=7695, Unknown=0, NotChecked=0, Total=8010 [2022-01-31 10:44:52,332 INFO L87 Difference]: Start difference. First operand 309 states and 313 transitions. Second operand has 90 states, 88 states have (on average 2.7613636363636362) internal successors, (243), 83 states have internal predecessors, (243), 73 states have call successors, (79), 5 states have call predecessors, (79), 3 states have return successors, (75), 73 states have call predecessors, (75), 71 states have call successors, (75) [2022-01-31 10:44:56,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:44:56,920 INFO L93 Difference]: Finished difference Result 460 states and 468 transitions. [2022-01-31 10:44:56,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-01-31 10:44:56,920 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 88 states have (on average 2.7613636363636362) internal successors, (243), 83 states have internal predecessors, (243), 73 states have call successors, (79), 5 states have call predecessors, (79), 3 states have return successors, (75), 73 states have call predecessors, (75), 71 states have call successors, (75) Word has length 305 [2022-01-31 10:44:56,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:44:56,922 INFO L225 Difference]: With dead ends: 460 [2022-01-31 10:44:56,922 INFO L226 Difference]: Without dead ends: 460 [2022-01-31 10:44:56,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 623 SyntacticMatches, 39 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7123 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=703, Invalid=17929, Unknown=0, NotChecked=0, Total=18632 [2022-01-31 10:44:56,923 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 342 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 14307 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 14989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 14307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 380 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-01-31 10:44:56,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 1191 Invalid, 14989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 14307 Invalid, 0 Unknown, 380 Unchecked, 3.7s Time] [2022-01-31 10:44:56,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-01-31 10:44:56,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 317. [2022-01-31 10:44:56,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 235 states have (on average 1.0127659574468084) internal successors, (238), 236 states have internal predecessors, (238), 42 states have call successors, (42), 40 states have call predecessors, (42), 39 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-01-31 10:44:56,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 321 transitions. [2022-01-31 10:44:56,926 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 321 transitions. Word has length 305 [2022-01-31 10:44:56,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:44:56,927 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 321 transitions. [2022-01-31 10:44:56,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 88 states have (on average 2.7613636363636362) internal successors, (243), 83 states have internal predecessors, (243), 73 states have call successors, (79), 5 states have call predecessors, (79), 3 states have return successors, (75), 73 states have call predecessors, (75), 71 states have call successors, (75) [2022-01-31 10:44:56,927 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 321 transitions. [2022-01-31 10:44:56,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2022-01-31 10:44:56,928 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:44:56,928 INFO L514 BasicCegarLoop]: trace histogram [21, 21, 21, 19, 19, 19, 19, 19, 17, 17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:44:56,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2022-01-31 10:44:57,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:44:57,134 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:44:57,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:44:57,134 INFO L85 PathProgramCache]: Analyzing trace with hash -251725652, now seen corresponding path program 60 times [2022-01-31 10:44:57,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:44:57,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672245427] [2022-01-31 10:44:57,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:44:57,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:44:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:57,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:44:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:57,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:44:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:57,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:44:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:57,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:44:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:57,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:44:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:57,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:44:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:57,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:44:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:57,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:44:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:57,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:44:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:57,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:44:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:57,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:44:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:57,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:44:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:57,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:44:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:57,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:44:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:57,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:44:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:57,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:44:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:57,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:44:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:57,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:44:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:57,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 10:44:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:57,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-31 10:44:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:57,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-01-31 10:44:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:57,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-01-31 10:44:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:57,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:44:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:57,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:44:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:57,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:44:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:57,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:44:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:57,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:44:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:58,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:44:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:58,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:44:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:58,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:44:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:58,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:44:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:58,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:44:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:58,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-01-31 10:44:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:58,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-01-31 10:44:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:58,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-01-31 10:44:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:58,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-01-31 10:44:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:58,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-01-31 10:44:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:58,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-01-31 10:44:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:44:58,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2567 backedges. 86 proven. 1275 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2022-01-31 10:44:58,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:44:58,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672245427] [2022-01-31 10:44:58,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672245427] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:44:58,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427401056] [2022-01-31 10:44:58,013 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 10:44:58,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:44:58,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:44:58,015 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:44:58,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-01-31 10:44:59,064 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2022-01-31 10:44:59,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:44:59,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 91 conjunts are in the unsatisfiable core [2022-01-31 10:44:59,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:45:00,269 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:45:00,394 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:45:00,394 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:45:00,559 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:45:00,559 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:45:02,905 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:45:03,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2567 backedges. 197 proven. 1304 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2022-01-31 10:45:03,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:45:03,418 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 21 treesize of output 19 [2022-01-31 10:45:03,420 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 37 treesize of output 33 [2022-01-31 10:45:03,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2567 backedges. 86 proven. 1274 refuted. 0 times theorem prover too weak. 1207 trivial. 0 not checked. [2022-01-31 10:45:03,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427401056] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:45:03,966 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:45:03,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 47] total 90 [2022-01-31 10:45:03,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948805317] [2022-01-31 10:45:03,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:45:03,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-01-31 10:45:03,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:45:03,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-01-31 10:45:03,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=7672, Unknown=0, NotChecked=0, Total=8010 [2022-01-31 10:45:03,967 INFO L87 Difference]: Start difference. First operand 317 states and 321 transitions. Second operand has 90 states, 88 states have (on average 2.784090909090909) internal successors, (245), 83 states have internal predecessors, (245), 72 states have call successors, (79), 5 states have call predecessors, (79), 3 states have return successors, (75), 72 states have call predecessors, (75), 70 states have call successors, (75) [2022-01-31 10:45:06,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:45:06,600 INFO L93 Difference]: Finished difference Result 401 states and 420 transitions. [2022-01-31 10:45:06,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-01-31 10:45:06,601 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 88 states have (on average 2.784090909090909) internal successors, (245), 83 states have internal predecessors, (245), 72 states have call successors, (79), 5 states have call predecessors, (79), 3 states have return successors, (75), 72 states have call predecessors, (75), 70 states have call successors, (75) Word has length 305 [2022-01-31 10:45:06,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:45:06,602 INFO L225 Difference]: With dead ends: 401 [2022-01-31 10:45:06,602 INFO L226 Difference]: Without dead ends: 401 [2022-01-31 10:45:06,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 798 GetRequests, 616 SyntacticMatches, 45 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7641 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=760, Invalid=18422, Unknown=0, NotChecked=0, Total=19182 [2022-01-31 10:45:06,604 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 274 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 7336 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 7867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 7336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 328 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-31 10:45:06,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 822 Invalid, 7867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 7336 Invalid, 0 Unknown, 328 Unchecked, 1.8s Time] [2022-01-31 10:45:06,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2022-01-31 10:45:06,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 379. [2022-01-31 10:45:06,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 281 states have (on average 1.01067615658363) internal successors, (284), 283 states have internal predecessors, (284), 57 states have call successors, (57), 41 states have call predecessors, (57), 40 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2022-01-31 10:45:06,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 397 transitions. [2022-01-31 10:45:06,632 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 397 transitions. Word has length 305 [2022-01-31 10:45:06,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:45:06,632 INFO L470 AbstractCegarLoop]: Abstraction has 379 states and 397 transitions. [2022-01-31 10:45:06,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 88 states have (on average 2.784090909090909) internal successors, (245), 83 states have internal predecessors, (245), 72 states have call successors, (79), 5 states have call predecessors, (79), 3 states have return successors, (75), 72 states have call predecessors, (75), 70 states have call successors, (75) [2022-01-31 10:45:06,633 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 397 transitions. [2022-01-31 10:45:06,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2022-01-31 10:45:06,634 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:45:06,634 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:45:06,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-01-31 10:45:06,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:45:06,852 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:45:06,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:45:06,853 INFO L85 PathProgramCache]: Analyzing trace with hash 364423154, now seen corresponding path program 61 times [2022-01-31 10:45:06,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:45:06,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952275042] [2022-01-31 10:45:06,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:45:06,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:45:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:45:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:45:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:45:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:45:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:45:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:45:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:45:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:45:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:45:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:45:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:45:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:45:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:45:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:45:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:45:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:45:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:45:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:45:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 10:45:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-31 10:45:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-01-31 10:45:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-31 10:45:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:45:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:45:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:45:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:45:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:45:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:45:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:45:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:45:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:45:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:45:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-01-31 10:45:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-01-31 10:45:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-01-31 10:45:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-01-31 10:45:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-01-31 10:45:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-01-31 10:45:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-01-31 10:45:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2686 backedges. 615 proven. 699 refuted. 0 times theorem prover too weak. 1372 trivial. 0 not checked. [2022-01-31 10:45:07,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:45:07,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952275042] [2022-01-31 10:45:07,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952275042] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:45:07,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465497818] [2022-01-31 10:45:07,378 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 10:45:07,378 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:45:07,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:45:07,379 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:45:07,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-01-31 10:45:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:07,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 40 conjunts are in the unsatisfiable core [2022-01-31 10:45:07,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:45:08,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2686 backedges. 684 proven. 630 refuted. 0 times theorem prover too weak. 1372 trivial. 0 not checked. [2022-01-31 10:45:08,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:45:09,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2686 backedges. 684 proven. 630 refuted. 0 times theorem prover too weak. 1372 trivial. 0 not checked. [2022-01-31 10:45:09,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465497818] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:45:09,117 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:45:09,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 63 [2022-01-31 10:45:09,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486482544] [2022-01-31 10:45:09,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:45:09,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-01-31 10:45:09,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:45:09,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-01-31 10:45:09,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=887, Invalid=3019, Unknown=0, NotChecked=0, Total=3906 [2022-01-31 10:45:09,118 INFO L87 Difference]: Start difference. First operand 379 states and 397 transitions. Second operand has 63 states, 63 states have (on average 3.015873015873016) internal successors, (190), 62 states have internal predecessors, (190), 58 states have call successors, (62), 3 states have call predecessors, (62), 1 states have return successors, (59), 57 states have call predecessors, (59), 57 states have call successors, (59) [2022-01-31 10:45:10,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:45:10,230 INFO L93 Difference]: Finished difference Result 403 states and 425 transitions. [2022-01-31 10:45:10,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-31 10:45:10,230 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 3.015873015873016) internal successors, (190), 62 states have internal predecessors, (190), 58 states have call successors, (62), 3 states have call predecessors, (62), 1 states have return successors, (59), 57 states have call predecessors, (59), 57 states have call successors, (59) Word has length 313 [2022-01-31 10:45:10,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:45:10,231 INFO L225 Difference]: With dead ends: 403 [2022-01-31 10:45:10,231 INFO L226 Difference]: Without dead ends: 321 [2022-01-31 10:45:10,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 682 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3068 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2194, Invalid=8312, Unknown=0, NotChecked=0, Total=10506 [2022-01-31 10:45:10,232 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 283 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 10:45:10,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 98 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 1409 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 10:45:10,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-01-31 10:45:10,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 308. [2022-01-31 10:45:10,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 228 states have (on average 1.0087719298245614) internal successors, (230), 229 states have internal predecessors, (230), 41 states have call successors, (41), 39 states have call predecessors, (41), 38 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-01-31 10:45:10,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 311 transitions. [2022-01-31 10:45:10,235 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 311 transitions. Word has length 313 [2022-01-31 10:45:10,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:45:10,235 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 311 transitions. [2022-01-31 10:45:10,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 3.015873015873016) internal successors, (190), 62 states have internal predecessors, (190), 58 states have call successors, (62), 3 states have call predecessors, (62), 1 states have return successors, (59), 57 states have call predecessors, (59), 57 states have call successors, (59) [2022-01-31 10:45:10,236 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 311 transitions. [2022-01-31 10:45:10,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2022-01-31 10:45:10,236 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:45:10,237 INFO L514 BasicCegarLoop]: trace histogram [21, 21, 21, 19, 19, 19, 19, 19, 18, 18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:45:10,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-01-31 10:45:10,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2022-01-31 10:45:10,451 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:45:10,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:45:10,452 INFO L85 PathProgramCache]: Analyzing trace with hash 750738878, now seen corresponding path program 62 times [2022-01-31 10:45:10,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:45:10,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249382570] [2022-01-31 10:45:10,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:45:10,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:45:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:45:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:45:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:45:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:45:11,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:45:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:45:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:45:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:45:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:45:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:45:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:45:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:45:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:45:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:45:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:45:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:45:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:45:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:45:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 10:45:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-31 10:45:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-01-31 10:45:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-01-31 10:45:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:45:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:45:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:45:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:45:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:45:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:45:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:45:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:45:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:45:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:45:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-01-31 10:45:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-01-31 10:45:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-01-31 10:45:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-01-31 10:45:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-01-31 10:45:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-01-31 10:45:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-01-31 10:45:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:11,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2699 backedges. 91 proven. 1338 refuted. 0 times theorem prover too weak. 1270 trivial. 0 not checked. [2022-01-31 10:45:11,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:45:11,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249382570] [2022-01-31 10:45:11,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249382570] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:45:11,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853452774] [2022-01-31 10:45:11,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 10:45:11,496 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:45:11,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:45:11,497 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:45:11,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-01-31 10:45:11,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 10:45:11,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:45:11,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 92 conjunts are in the unsatisfiable core [2022-01-31 10:45:11,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:45:12,763 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:45:12,965 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-31 10:45:12,965 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-31 10:45:16,777 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:45:16,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2699 backedges. 235 proven. 1372 refuted. 64 times theorem prover too weak. 1028 trivial. 0 not checked. [2022-01-31 10:45:16,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:45:17,124 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 21 treesize of output 19 [2022-01-31 10:45:17,126 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 37 treesize of output 33 [2022-01-31 10:45:17,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2699 backedges. 91 proven. 1338 refuted. 0 times theorem prover too weak. 1270 trivial. 0 not checked. [2022-01-31 10:45:17,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853452774] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:45:17,567 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:45:17,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 48] total 96 [2022-01-31 10:45:17,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300109911] [2022-01-31 10:45:17,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:45:17,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-01-31 10:45:17,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:45:17,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-01-31 10:45:17,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=8738, Unknown=1, NotChecked=0, Total=9120 [2022-01-31 10:45:17,569 INFO L87 Difference]: Start difference. First operand 308 states and 311 transitions. Second operand has 96 states, 93 states have (on average 2.752688172043011) internal successors, (256), 88 states have internal predecessors, (256), 76 states have call successors, (82), 6 states have call predecessors, (82), 4 states have return successors, (78), 76 states have call predecessors, (78), 74 states have call successors, (78) [2022-01-31 10:45:21,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:45:21,983 INFO L93 Difference]: Finished difference Result 461 states and 466 transitions. [2022-01-31 10:45:21,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-01-31 10:45:21,983 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 93 states have (on average 2.752688172043011) internal successors, (256), 88 states have internal predecessors, (256), 76 states have call successors, (82), 6 states have call predecessors, (82), 4 states have return successors, (78), 76 states have call predecessors, (78), 74 states have call successors, (78) Word has length 313 [2022-01-31 10:45:21,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:45:21,984 INFO L225 Difference]: With dead ends: 461 [2022-01-31 10:45:21,984 INFO L226 Difference]: Without dead ends: 461 [2022-01-31 10:45:21,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 823 GetRequests, 635 SyntacticMatches, 42 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8410 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=880, Invalid=20873, Unknown=3, NotChecked=0, Total=21756 [2022-01-31 10:45:21,986 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 254 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 8355 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 1393 SdHoareTripleChecker+Invalid, 8896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 8355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 381 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-31 10:45:21,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 1393 Invalid, 8896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 8355 Invalid, 0 Unknown, 381 Unchecked, 2.6s Time] [2022-01-31 10:45:21,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-01-31 10:45:21,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 325. [2022-01-31 10:45:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 241 states have (on average 1.012448132780083) internal successors, (244), 242 states have internal predecessors, (244), 43 states have call successors, (43), 41 states have call predecessors, (43), 40 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2022-01-31 10:45:21,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 329 transitions. [2022-01-31 10:45:21,990 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 329 transitions. Word has length 313 [2022-01-31 10:45:21,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:45:21,990 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 329 transitions. [2022-01-31 10:45:21,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 93 states have (on average 2.752688172043011) internal successors, (256), 88 states have internal predecessors, (256), 76 states have call successors, (82), 6 states have call predecessors, (82), 4 states have return successors, (78), 76 states have call predecessors, (78), 74 states have call successors, (78) [2022-01-31 10:45:21,990 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 329 transitions. [2022-01-31 10:45:21,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2022-01-31 10:45:21,991 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:45:21,991 INFO L514 BasicCegarLoop]: trace histogram [21, 21, 21, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:45:22,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-01-31 10:45:22,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:45:22,209 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:45:22,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:45:22,210 INFO L85 PathProgramCache]: Analyzing trace with hash 354062544, now seen corresponding path program 63 times [2022-01-31 10:45:22,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:45:22,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484796598] [2022-01-31 10:45:22,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:45:22,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:45:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:45:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:45:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:45:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:45:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:45:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:45:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:45:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:45:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:45:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:45:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:45:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:45:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:45:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:45:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:45:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:45:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:45:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:45:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 10:45:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-31 10:45:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-01-31 10:45:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-01-31 10:45:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:45:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:45:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:45:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:45:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:45:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:45:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:45:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:45:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:45:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:45:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-01-31 10:45:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-01-31 10:45:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-01-31 10:45:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-01-31 10:45:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-01-31 10:45:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-01-31 10:45:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-01-31 10:45:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-01-31 10:45:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:45:22,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2839 backedges. 96 proven. 1405 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2022-01-31 10:45:22,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:45:22,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484796598] [2022-01-31 10:45:22,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484796598] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:45:22,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449813281] [2022-01-31 10:45:22,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 10:45:22,979 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:45:22,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:45:22,980 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:45:22,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-01-31 10:45:24,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2022-01-31 10:45:24,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:45:24,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 96 conjunts are in the unsatisfiable core [2022-01-31 10:45:24,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:45:25,456 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:45:56,083 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-01-31 10:45:56,083 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-01-31 10:45:56,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2839 backedges. 60 proven. 1441 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2022-01-31 10:45:56,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:46:02,013 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 16 treesize of output 14 [2022-01-31 10:46:02,015 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 32 treesize of output 28 [2022-01-31 10:46:02,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449813281] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:46:02,165 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 10:46:02,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 51] total 96 [2022-01-31 10:46:02,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334267399] [2022-01-31 10:46:02,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 10:46:02,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-01-31 10:46:02,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:46:02,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-01-31 10:46:02,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=907, Invalid=13371, Unknown=2, NotChecked=0, Total=14280 [2022-01-31 10:46:02,167 INFO L87 Difference]: Start difference. First operand 325 states and 329 transitions. Second operand has 96 states, 94 states have (on average 2.6808510638297873) internal successors, (252), 89 states have internal predecessors, (252), 77 states have call successors, (81), 5 states have call predecessors, (81), 3 states have return successors, (78), 77 states have call predecessors, (78), 75 states have call successors, (78) [2022-01-31 10:46:04,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:46:04,534 INFO L93 Difference]: Finished difference Result 469 states and 474 transitions. [2022-01-31 10:46:04,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-01-31 10:46:04,534 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 94 states have (on average 2.6808510638297873) internal successors, (252), 89 states have internal predecessors, (252), 77 states have call successors, (81), 5 states have call predecessors, (81), 3 states have return successors, (78), 77 states have call predecessors, (78), 75 states have call successors, (78) Word has length 321 [2022-01-31 10:46:04,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:46:04,536 INFO L225 Difference]: With dead ends: 469 [2022-01-31 10:46:04,536 INFO L226 Difference]: Without dead ends: 469 [2022-01-31 10:46:04,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 448 SyntacticMatches, 37 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8164 ImplicationChecksByTransitivity, 37.1s TimeCoverageRelationStatistics Valid=1217, Invalid=20537, Unknown=2, NotChecked=0, Total=21756 [2022-01-31 10:46:04,537 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 155 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 4936 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 5871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 4936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 828 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-31 10:46:04,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 1622 Invalid, 5871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 4936 Invalid, 0 Unknown, 828 Unchecked, 1.5s Time] [2022-01-31 10:46:04,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-01-31 10:46:04,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 333. [2022-01-31 10:46:04,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 247 states have (on average 1.0121457489878543) internal successors, (250), 248 states have internal predecessors, (250), 44 states have call successors, (44), 42 states have call predecessors, (44), 41 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-01-31 10:46:04,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 337 transitions. [2022-01-31 10:46:04,541 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 337 transitions. Word has length 321 [2022-01-31 10:46:04,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:46:04,541 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 337 transitions. [2022-01-31 10:46:04,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 94 states have (on average 2.6808510638297873) internal successors, (252), 89 states have internal predecessors, (252), 77 states have call successors, (81), 5 states have call predecessors, (81), 3 states have return successors, (78), 77 states have call predecessors, (78), 75 states have call successors, (78) [2022-01-31 10:46:04,541 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 337 transitions. [2022-01-31 10:46:04,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2022-01-31 10:46:04,542 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:46:04,542 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 20, 20, 20, 20, 20, 18, 18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:46:04,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2022-01-31 10:46:04,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-01-31 10:46:04,746 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:46:04,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:46:04,747 INFO L85 PathProgramCache]: Analyzing trace with hash 740378268, now seen corresponding path program 64 times [2022-01-31 10:46:04,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:46:04,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423065510] [2022-01-31 10:46:04,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:46:04,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:46:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:46:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:46:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:46:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:46:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:46:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:46:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:46:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:46:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:46:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:46:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:46:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:46:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:46:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:46:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:46:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:46:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:46:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:46:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 10:46:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-31 10:46:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-01-31 10:46:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-01-31 10:46:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-01-31 10:46:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:46:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:46:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:46:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:46:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:46:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:46:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:46:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:46:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:46:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-01-31 10:46:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-01-31 10:46:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-01-31 10:46:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-01-31 10:46:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-01-31 10:46:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-01-31 10:46:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-01-31 10:46:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-01-31 10:46:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:05,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2860 backedges. 91 proven. 1421 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2022-01-31 10:46:05,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:46:05,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423065510] [2022-01-31 10:46:05,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423065510] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:46:05,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544806057] [2022-01-31 10:46:05,704 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 10:46:05,704 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:46:05,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:46:05,705 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:46:05,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-01-31 10:46:06,099 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 10:46:06,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:46:06,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 95 conjunts are in the unsatisfiable core [2022-01-31 10:46:06,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:46:07,275 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:46:07,367 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:46:07,367 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:46:07,485 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:46:07,485 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:46:09,514 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:46:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2860 backedges. 208 proven. 1452 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2022-01-31 10:46:09,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:46:09,947 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 21 treesize of output 19 [2022-01-31 10:46:09,948 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 37 treesize of output 33 [2022-01-31 10:46:10,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2860 backedges. 91 proven. 1420 refuted. 0 times theorem prover too weak. 1349 trivial. 0 not checked. [2022-01-31 10:46:10,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544806057] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:46:10,342 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:46:10,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 49, 49] total 96 [2022-01-31 10:46:10,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809662441] [2022-01-31 10:46:10,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:46:10,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-01-31 10:46:10,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:46:10,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-01-31 10:46:10,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=8757, Unknown=0, NotChecked=0, Total=9120 [2022-01-31 10:46:10,344 INFO L87 Difference]: Start difference. First operand 333 states and 337 transitions. Second operand has 96 states, 93 states have (on average 2.774193548387097) internal successors, (258), 88 states have internal predecessors, (258), 77 states have call successors, (84), 5 states have call predecessors, (84), 3 states have return successors, (80), 77 states have call predecessors, (80), 75 states have call successors, (80) [2022-01-31 10:46:13,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:46:13,230 INFO L93 Difference]: Finished difference Result 421 states and 441 transitions. [2022-01-31 10:46:13,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-01-31 10:46:13,231 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 93 states have (on average 2.774193548387097) internal successors, (258), 88 states have internal predecessors, (258), 77 states have call successors, (84), 5 states have call predecessors, (84), 3 states have return successors, (80), 77 states have call predecessors, (80), 75 states have call successors, (80) Word has length 321 [2022-01-31 10:46:13,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:46:13,232 INFO L225 Difference]: With dead ends: 421 [2022-01-31 10:46:13,232 INFO L226 Difference]: Without dead ends: 421 [2022-01-31 10:46:13,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 823 GetRequests, 631 SyntacticMatches, 47 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8557 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=807, Invalid=20655, Unknown=0, NotChecked=0, Total=21462 [2022-01-31 10:46:13,234 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 186 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 8808 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 9303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 8808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 299 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-31 10:46:13,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 1035 Invalid, 9303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 8808 Invalid, 0 Unknown, 299 Unchecked, 2.1s Time] [2022-01-31 10:46:13,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-01-31 10:46:13,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 399. [2022-01-31 10:46:13,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 296 states have (on average 1.010135135135135) internal successors, (299), 298 states have internal predecessors, (299), 60 states have call successors, (60), 43 states have call predecessors, (60), 42 states have return successors, (59), 57 states have call predecessors, (59), 59 states have call successors, (59) [2022-01-31 10:46:13,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 418 transitions. [2022-01-31 10:46:13,238 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 418 transitions. Word has length 321 [2022-01-31 10:46:13,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:46:13,247 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 418 transitions. [2022-01-31 10:46:13,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 93 states have (on average 2.774193548387097) internal successors, (258), 88 states have internal predecessors, (258), 77 states have call successors, (84), 5 states have call predecessors, (84), 3 states have return successors, (80), 77 states have call predecessors, (80), 75 states have call successors, (80) [2022-01-31 10:46:13,247 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 418 transitions. [2022-01-31 10:46:13,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2022-01-31 10:46:13,249 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:46:13,249 INFO L514 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:46:13,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Ended with exit code 0 [2022-01-31 10:46:13,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-01-31 10:46:13,472 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:46:13,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:46:13,472 INFO L85 PathProgramCache]: Analyzing trace with hash -2124246558, now seen corresponding path program 65 times [2022-01-31 10:46:13,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:46:13,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084254688] [2022-01-31 10:46:13,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:46:13,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:46:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:46:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:46:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:46:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:46:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:46:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:46:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:46:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:46:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:46:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:46:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:46:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:46:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:46:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:46:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:46:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:46:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:46:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:46:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 10:46:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-31 10:46:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-01-31 10:46:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-01-31 10:46:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-31 10:46:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:46:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:46:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:46:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:46:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:46:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:46:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:46:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:46:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:46:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-01-31 10:46:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-01-31 10:46:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-01-31 10:46:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-01-31 10:46:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-01-31 10:46:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-01-31 10:46:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-01-31 10:46:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-01-31 10:46:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2022-01-31 10:46:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2987 backedges. 687 proven. 776 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2022-01-31 10:46:13,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:46:13,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084254688] [2022-01-31 10:46:13,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084254688] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:46:13,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78978072] [2022-01-31 10:46:13,866 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 10:46:13,866 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:46:13,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:46:13,875 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:46:13,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-01-31 10:46:14,397 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2022-01-31 10:46:14,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:46:14,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 42 conjunts are in the unsatisfiable core [2022-01-31 10:46:14,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:46:15,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2987 backedges. 760 proven. 703 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2022-01-31 10:46:15,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:46:15,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2987 backedges. 760 proven. 703 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2022-01-31 10:46:15,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78978072] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:46:15,326 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:46:15,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 66 [2022-01-31 10:46:15,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356228854] [2022-01-31 10:46:15,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:46:15,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-01-31 10:46:15,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:46:15,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-01-31 10:46:15,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=973, Invalid=3317, Unknown=0, NotChecked=0, Total=4290 [2022-01-31 10:46:15,328 INFO L87 Difference]: Start difference. First operand 399 states and 418 transitions. Second operand has 66 states, 66 states have (on average 3.015151515151515) internal successors, (199), 65 states have internal predecessors, (199), 61 states have call successors, (65), 3 states have call predecessors, (65), 1 states have return successors, (62), 60 states have call predecessors, (62), 60 states have call successors, (62) [2022-01-31 10:46:16,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:46:16,091 INFO L93 Difference]: Finished difference Result 423 states and 446 transitions. [2022-01-31 10:46:16,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-01-31 10:46:16,091 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 3.015151515151515) internal successors, (199), 65 states have internal predecessors, (199), 61 states have call successors, (65), 3 states have call predecessors, (65), 1 states have return successors, (62), 60 states have call predecessors, (62), 60 states have call successors, (62) Word has length 329 [2022-01-31 10:46:16,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:46:16,092 INFO L225 Difference]: With dead ends: 423 [2022-01-31 10:46:16,092 INFO L226 Difference]: Without dead ends: 337 [2022-01-31 10:46:16,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 824 GetRequests, 717 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3380 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2408, Invalid=9148, Unknown=0, NotChecked=0, Total=11556 [2022-01-31 10:46:16,094 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 352 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 10:46:16,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [356 Valid, 90 Invalid, 1780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [487 Valid, 1293 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 10:46:16,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-01-31 10:46:16,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 324. [2022-01-31 10:46:16,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 240 states have (on average 1.0083333333333333) internal successors, (242), 241 states have internal predecessors, (242), 43 states have call successors, (43), 41 states have call predecessors, (43), 40 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2022-01-31 10:46:16,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 327 transitions. [2022-01-31 10:46:16,097 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 327 transitions. Word has length 329 [2022-01-31 10:46:16,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:46:16,097 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 327 transitions. [2022-01-31 10:46:16,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 3.015151515151515) internal successors, (199), 65 states have internal predecessors, (199), 61 states have call successors, (65), 3 states have call predecessors, (65), 1 states have return successors, (62), 60 states have call predecessors, (62), 60 states have call successors, (62) [2022-01-31 10:46:16,097 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 327 transitions. [2022-01-31 10:46:16,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2022-01-31 10:46:16,098 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:46:16,099 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 20, 20, 20, 20, 20, 19, 19, 19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:46:16,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2022-01-31 10:46:16,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-01-31 10:46:16,303 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:46:16,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:46:16,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1150501970, now seen corresponding path program 66 times [2022-01-31 10:46:16,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:46:16,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109316443] [2022-01-31 10:46:16,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:46:16,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:46:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:46:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:46:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:46:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:46:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:46:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:46:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:46:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:46:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:46:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:46:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:46:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:46:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:46:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:46:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:46:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:46:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:46:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:46:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 10:46:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-31 10:46:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-01-31 10:46:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-01-31 10:46:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-01-31 10:46:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:46:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:46:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:46:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:46:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:46:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:46:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:46:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:46:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:46:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-01-31 10:46:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-01-31 10:46:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-01-31 10:46:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-01-31 10:46:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-01-31 10:46:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-01-31 10:46:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-01-31 10:46:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-01-31 10:46:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2022-01-31 10:46:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:17,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3000 backedges. 96 proven. 1488 refuted. 0 times theorem prover too weak. 1416 trivial. 0 not checked. [2022-01-31 10:46:17,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:46:17,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109316443] [2022-01-31 10:46:17,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109316443] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:46:17,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344700006] [2022-01-31 10:46:17,085 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 10:46:17,085 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:46:17,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:46:17,086 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:46:17,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-01-31 10:46:18,637 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-01-31 10:46:18,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:46:18,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 96 conjunts are in the unsatisfiable core [2022-01-31 10:46:18,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:46:19,638 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:46:19,839 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-31 10:46:19,839 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 27 treesize of output 26 [2022-01-31 10:46:23,818 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:46:23,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3000 backedges. 146 proven. 1524 refuted. 120 times theorem prover too weak. 1210 trivial. 0 not checked. [2022-01-31 10:46:23,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:46:24,298 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 21 treesize of output 19 [2022-01-31 10:46:24,300 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 37 treesize of output 33 [2022-01-31 10:46:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3000 backedges. 96 proven. 1488 refuted. 0 times theorem prover too weak. 1416 trivial. 0 not checked. [2022-01-31 10:46:24,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344700006] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:46:24,848 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:46:24,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 50] total 100 [2022-01-31 10:46:24,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500066218] [2022-01-31 10:46:24,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:46:24,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2022-01-31 10:46:24,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:46:24,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2022-01-31 10:46:24,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=9501, Unknown=1, NotChecked=0, Total=9900 [2022-01-31 10:46:24,849 INFO L87 Difference]: Start difference. First operand 324 states and 327 transitions. Second operand has 100 states, 97 states have (on average 2.7628865979381443) internal successors, (268), 92 states have internal predecessors, (268), 80 states have call successors, (86), 6 states have call predecessors, (86), 4 states have return successors, (82), 80 states have call predecessors, (82), 78 states have call successors, (82) [2022-01-31 10:46:30,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:46:30,272 INFO L93 Difference]: Finished difference Result 489 states and 494 transitions. [2022-01-31 10:46:30,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-01-31 10:46:30,273 INFO L78 Accepts]: Start accepts. Automaton has has 100 states, 97 states have (on average 2.7628865979381443) internal successors, (268), 92 states have internal predecessors, (268), 80 states have call successors, (86), 6 states have call predecessors, (86), 4 states have return successors, (82), 80 states have call predecessors, (82), 78 states have call successors, (82) Word has length 329 [2022-01-31 10:46:30,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:46:30,274 INFO L225 Difference]: With dead ends: 489 [2022-01-31 10:46:30,274 INFO L226 Difference]: Without dead ends: 489 [2022-01-31 10:46:30,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 666 SyntacticMatches, 45 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9436 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=932, Invalid=22935, Unknown=3, NotChecked=0, Total=23870 [2022-01-31 10:46:30,276 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 244 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 9789 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 10472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 9789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 502 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-01-31 10:46:30,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 1315 Invalid, 10472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 9789 Invalid, 0 Unknown, 502 Unchecked, 3.2s Time] [2022-01-31 10:46:30,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2022-01-31 10:46:30,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 341. [2022-01-31 10:46:30,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 253 states have (on average 1.0118577075098814) internal successors, (256), 254 states have internal predecessors, (256), 45 states have call successors, (45), 43 states have call predecessors, (45), 42 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2022-01-31 10:46:30,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 345 transitions. [2022-01-31 10:46:30,279 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 345 transitions. Word has length 329 [2022-01-31 10:46:30,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:46:30,280 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 345 transitions. [2022-01-31 10:46:30,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 97 states have (on average 2.7628865979381443) internal successors, (268), 92 states have internal predecessors, (268), 80 states have call successors, (86), 6 states have call predecessors, (86), 4 states have return successors, (82), 80 states have call predecessors, (82), 78 states have call successors, (82) [2022-01-31 10:46:30,280 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 345 transitions. [2022-01-31 10:46:30,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2022-01-31 10:46:30,281 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:46:30,281 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:46:30,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2022-01-31 10:46:30,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-01-31 10:46:30,499 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:46:30,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:46:30,500 INFO L85 PathProgramCache]: Analyzing trace with hash -2092761408, now seen corresponding path program 67 times [2022-01-31 10:46:30,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:46:30,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498468234] [2022-01-31 10:46:30,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:46:30,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:46:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:46:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:46:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:46:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:46:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:46:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:46:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:46:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:46:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:46:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:46:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:46:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:46:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:46:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:46:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:46:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:46:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:46:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:46:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 10:46:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-31 10:46:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-01-31 10:46:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-01-31 10:46:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-01-31 10:46:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:46:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:46:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:46:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:46:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:46:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:46:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:46:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:46:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:46:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-01-31 10:46:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-01-31 10:46:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-01-31 10:46:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-01-31 10:46:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-01-31 10:46:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-01-31 10:46:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-01-31 10:46:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-01-31 10:46:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2022-01-31 10:46:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2022-01-31 10:46:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3148 backedges. 101 proven. 1559 refuted. 0 times theorem prover too weak. 1488 trivial. 0 not checked. [2022-01-31 10:46:31,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:46:31,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498468234] [2022-01-31 10:46:31,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498468234] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:46:31,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990309131] [2022-01-31 10:46:31,365 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 10:46:31,365 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:46:31,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:46:31,366 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:46:31,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-01-31 10:46:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:31,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 97 conjunts are in the unsatisfiable core [2022-01-31 10:46:31,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:46:32,983 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-31 10:46:36,156 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:46:36,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3148 backedges. 63 proven. 1597 refuted. 0 times theorem prover too weak. 1488 trivial. 0 not checked. [2022-01-31 10:46:36,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:46:36,659 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 16 treesize of output 14 [2022-01-31 10:46:36,661 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 32 treesize of output 28 [2022-01-31 10:46:37,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3148 backedges. 101 proven. 1559 refuted. 0 times theorem prover too weak. 1488 trivial. 0 not checked. [2022-01-31 10:46:37,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990309131] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:46:37,049 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:46:37,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 50] total 98 [2022-01-31 10:46:37,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378801498] [2022-01-31 10:46:37,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:46:37,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-01-31 10:46:37,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:46:37,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-01-31 10:46:37,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=9161, Unknown=0, NotChecked=0, Total=9506 [2022-01-31 10:46:37,051 INFO L87 Difference]: Start difference. First operand 341 states and 345 transitions. Second operand has 98 states, 96 states have (on average 2.78125) internal successors, (267), 91 states have internal predecessors, (267), 81 states have call successors, (87), 5 states have call predecessors, (87), 3 states have return successors, (83), 81 states have call predecessors, (83), 79 states have call successors, (83) [2022-01-31 10:46:41,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:46:41,208 INFO L93 Difference]: Finished difference Result 508 states and 516 transitions. [2022-01-31 10:46:41,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-01-31 10:46:41,208 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 96 states have (on average 2.78125) internal successors, (267), 91 states have internal predecessors, (267), 81 states have call successors, (87), 5 states have call predecessors, (87), 3 states have return successors, (83), 81 states have call predecessors, (83), 79 states have call successors, (83) Word has length 337 [2022-01-31 10:46:41,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:46:41,209 INFO L225 Difference]: With dead ends: 508 [2022-01-31 10:46:41,209 INFO L226 Difference]: Without dead ends: 508 [2022-01-31 10:46:41,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 881 GetRequests, 690 SyntacticMatches, 43 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8673 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=770, Invalid=21580, Unknown=0, NotChecked=0, Total=22350 [2022-01-31 10:46:41,211 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 449 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 14546 mSolverCounterSat, 397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 15315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 397 IncrementalHoareTripleChecker+Valid, 14546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 372 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-01-31 10:46:41,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [452 Valid, 924 Invalid, 15315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [397 Valid, 14546 Invalid, 0 Unknown, 372 Unchecked, 3.3s Time] [2022-01-31 10:46:41,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2022-01-31 10:46:41,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 349. [2022-01-31 10:46:41,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 259 states have (on average 1.0115830115830116) internal successors, (262), 260 states have internal predecessors, (262), 46 states have call successors, (46), 44 states have call predecessors, (46), 43 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2022-01-31 10:46:41,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 353 transitions. [2022-01-31 10:46:41,214 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 353 transitions. Word has length 337 [2022-01-31 10:46:41,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:46:41,214 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 353 transitions. [2022-01-31 10:46:41,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 96 states have (on average 2.78125) internal successors, (267), 91 states have internal predecessors, (267), 81 states have call successors, (87), 5 states have call predecessors, (87), 3 states have return successors, (83), 81 states have call predecessors, (83), 79 states have call successors, (83) [2022-01-31 10:46:41,215 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 353 transitions. [2022-01-31 10:46:41,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2022-01-31 10:46:41,216 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:46:41,216 INFO L514 BasicCegarLoop]: trace histogram [23, 23, 23, 21, 21, 21, 21, 21, 19, 19, 19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:46:41,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2022-01-31 10:46:41,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:46:41,431 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:46:41,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:46:41,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1119016820, now seen corresponding path program 68 times [2022-01-31 10:46:41,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:46:41,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852198819] [2022-01-31 10:46:41,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:46:41,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:46:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:46:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:46:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:46:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:46:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:46:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:46:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:46:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:46:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:46:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:46:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:46:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:46:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:46:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:46:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:46:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:46:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:46:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:46:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 10:46:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-31 10:46:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-01-31 10:46:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-01-31 10:46:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-01-31 10:46:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-01-31 10:46:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:46:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:46:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:46:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:46:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:46:42,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:46:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:46:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:46:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-01-31 10:46:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-01-31 10:46:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-01-31 10:46:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-01-31 10:46:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-01-31 10:46:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-01-31 10:46:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-01-31 10:46:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-01-31 10:46:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2022-01-31 10:46:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2022-01-31 10:46:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3169 backedges. 96 proven. 1575 refuted. 0 times theorem prover too weak. 1498 trivial. 0 not checked. [2022-01-31 10:46:42,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:46:42,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852198819] [2022-01-31 10:46:42,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852198819] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:46:42,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160187751] [2022-01-31 10:46:42,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 10:46:42,618 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:46:42,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:46:42,628 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:46:42,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-01-31 10:46:42,873 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 10:46:42,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:46:42,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 99 conjunts are in the unsatisfiable core [2022-01-31 10:46:42,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:46:44,282 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:46:44,413 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:46:44,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:46:44,582 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:46:44,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 25 treesize of output 24 [2022-01-31 10:46:46,844 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:46:46,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3169 backedges. 219 proven. 1608 refuted. 0 times theorem prover too weak. 1342 trivial. 0 not checked. [2022-01-31 10:46:46,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:46:47,282 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 21 treesize of output 19 [2022-01-31 10:46:47,283 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 37 treesize of output 33 [2022-01-31 10:46:47,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3169 backedges. 96 proven. 1574 refuted. 0 times theorem prover too weak. 1499 trivial. 0 not checked. [2022-01-31 10:46:47,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160187751] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:46:47,699 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:46:47,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 51, 51] total 100 [2022-01-31 10:46:47,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973764953] [2022-01-31 10:46:47,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:46:47,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2022-01-31 10:46:47,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:46:47,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2022-01-31 10:46:47,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=9521, Unknown=0, NotChecked=0, Total=9900 [2022-01-31 10:46:47,701 INFO L87 Difference]: Start difference. First operand 349 states and 353 transitions. Second operand has 100 states, 97 states have (on average 2.783505154639175) internal successors, (270), 92 states have internal predecessors, (270), 81 states have call successors, (88), 5 states have call predecessors, (88), 3 states have return successors, (84), 81 states have call predecessors, (84), 79 states have call successors, (84) [2022-01-31 10:46:50,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:46:50,536 INFO L93 Difference]: Finished difference Result 437 states and 457 transitions. [2022-01-31 10:46:50,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-01-31 10:46:50,537 INFO L78 Accepts]: Start accepts. Automaton has has 100 states, 97 states have (on average 2.783505154639175) internal successors, (270), 92 states have internal predecessors, (270), 81 states have call successors, (88), 5 states have call predecessors, (88), 3 states have return successors, (84), 81 states have call predecessors, (84), 79 states have call successors, (84) Word has length 337 [2022-01-31 10:46:50,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:46:50,538 INFO L225 Difference]: With dead ends: 437 [2022-01-31 10:46:50,538 INFO L226 Difference]: Without dead ends: 437 [2022-01-31 10:46:50,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 883 GetRequests, 683 SyntacticMatches, 49 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9326 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=840, Invalid=22416, Unknown=0, NotChecked=0, Total=23256 [2022-01-31 10:46:50,540 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 255 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 8420 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 8937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 8420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 311 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-31 10:46:50,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 1025 Invalid, 8937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 8420 Invalid, 0 Unknown, 311 Unchecked, 2.0s Time] [2022-01-31 10:46:50,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-01-31 10:46:50,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 419. [2022-01-31 10:46:50,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 311 states have (on average 1.0096463022508038) internal successors, (314), 313 states have internal predecessors, (314), 63 states have call successors, (63), 45 states have call predecessors, (63), 44 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2022-01-31 10:46:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 439 transitions. [2022-01-31 10:46:50,550 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 439 transitions. Word has length 337 [2022-01-31 10:46:50,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:46:50,550 INFO L470 AbstractCegarLoop]: Abstraction has 419 states and 439 transitions. [2022-01-31 10:46:50,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 97 states have (on average 2.783505154639175) internal successors, (270), 92 states have internal predecessors, (270), 81 states have call successors, (88), 5 states have call predecessors, (88), 3 states have return successors, (84), 81 states have call predecessors, (84), 79 states have call successors, (84) [2022-01-31 10:46:50,550 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 439 transitions. [2022-01-31 10:46:50,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2022-01-31 10:46:50,551 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:46:50,551 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:46:50,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2022-01-31 10:46:50,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:46:50,768 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:46:50,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:46:50,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1794510802, now seen corresponding path program 69 times [2022-01-31 10:46:50,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:46:50,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360690103] [2022-01-31 10:46:50,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:46:50,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:46:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:46:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:46:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:46:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:46:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:46:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:46:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:46:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:46:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:46:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:46:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:46:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:46:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:46:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:46:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:46:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:46:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:46:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:46:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 10:46:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-31 10:46:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-01-31 10:46:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-01-31 10:46:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-01-31 10:46:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-01-31 10:46:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:46:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:46:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:46:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:46:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:46:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:46:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:46:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:46:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-01-31 10:46:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-01-31 10:46:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-01-31 10:46:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-01-31 10:46:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-01-31 10:46:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-01-31 10:46:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-01-31 10:46:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-01-31 10:46:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2022-01-31 10:46:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2022-01-31 10:46:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-01-31 10:46:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:51,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3304 backedges. 763 proven. 857 refuted. 0 times theorem prover too weak. 1684 trivial. 0 not checked. [2022-01-31 10:46:51,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:46:51,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360690103] [2022-01-31 10:46:51,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360690103] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:46:51,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893363661] [2022-01-31 10:46:51,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 10:46:51,304 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:46:51,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:46:51,305 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:46:51,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-01-31 10:46:52,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2022-01-31 10:46:52,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:46:52,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 44 conjunts are in the unsatisfiable core [2022-01-31 10:46:52,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:46:53,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3304 backedges. 840 proven. 780 refuted. 0 times theorem prover too weak. 1684 trivial. 0 not checked. [2022-01-31 10:46:53,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:46:54,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3304 backedges. 840 proven. 780 refuted. 0 times theorem prover too weak. 1684 trivial. 0 not checked. [2022-01-31 10:46:54,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893363661] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:46:54,283 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:46:54,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 45] total 69 [2022-01-31 10:46:54,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527973344] [2022-01-31 10:46:54,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:46:54,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-01-31 10:46:54,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:46:54,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-01-31 10:46:54,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1063, Invalid=3629, Unknown=0, NotChecked=0, Total=4692 [2022-01-31 10:46:54,285 INFO L87 Difference]: Start difference. First operand 419 states and 439 transitions. Second operand has 69 states, 69 states have (on average 3.0144927536231885) internal successors, (208), 68 states have internal predecessors, (208), 64 states have call successors, (68), 3 states have call predecessors, (68), 1 states have return successors, (65), 63 states have call predecessors, (65), 63 states have call successors, (65) [2022-01-31 10:46:55,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:46:55,479 INFO L93 Difference]: Finished difference Result 443 states and 467 transitions. [2022-01-31 10:46:55,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-31 10:46:55,479 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 3.0144927536231885) internal successors, (208), 68 states have internal predecessors, (208), 64 states have call successors, (68), 3 states have call predecessors, (68), 1 states have return successors, (65), 63 states have call predecessors, (65), 63 states have call successors, (65) Word has length 345 [2022-01-31 10:46:55,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:46:55,480 INFO L225 Difference]: With dead ends: 443 [2022-01-31 10:46:55,480 INFO L226 Difference]: Without dead ends: 353 [2022-01-31 10:46:55,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 752 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3707 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2632, Invalid=10024, Unknown=0, NotChecked=0, Total=12656 [2022-01-31 10:46:55,481 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 354 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 2056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 10:46:55,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [358 Valid, 112 Invalid, 2056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 10:46:55,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-01-31 10:46:55,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 340. [2022-01-31 10:46:55,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 252 states have (on average 1.007936507936508) internal successors, (254), 253 states have internal predecessors, (254), 45 states have call successors, (45), 43 states have call predecessors, (45), 42 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2022-01-31 10:46:55,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 343 transitions. [2022-01-31 10:46:55,485 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 343 transitions. Word has length 345 [2022-01-31 10:46:55,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:46:55,485 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 343 transitions. [2022-01-31 10:46:55,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 3.0144927536231885) internal successors, (208), 68 states have internal predecessors, (208), 64 states have call successors, (68), 3 states have call predecessors, (68), 1 states have return successors, (65), 63 states have call predecessors, (65), 63 states have call successors, (65) [2022-01-31 10:46:55,485 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 343 transitions. [2022-01-31 10:46:55,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2022-01-31 10:46:55,486 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:46:55,486 INFO L514 BasicCegarLoop]: trace histogram [23, 23, 23, 21, 21, 21, 21, 21, 20, 20, 20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:46:55,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Ended with exit code 0 [2022-01-31 10:46:55,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:46:55,703 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:46:55,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:46:55,704 INFO L85 PathProgramCache]: Analyzing trace with hash 391097758, now seen corresponding path program 70 times [2022-01-31 10:46:55,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:46:55,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354636109] [2022-01-31 10:46:55,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:46:55,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:46:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:46:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:46:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:46:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:46:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:46:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:46:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:46:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:46:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:46:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:46:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:46:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:46:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:46:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:46:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:46:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:46:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:46:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:46:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 10:46:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-31 10:46:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-01-31 10:46:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-01-31 10:46:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-01-31 10:46:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-01-31 10:46:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:46:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:46:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:46:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:46:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:46:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:46:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:46:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:46:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-01-31 10:46:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-01-31 10:46:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-01-31 10:46:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-01-31 10:46:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-01-31 10:46:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-01-31 10:46:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-01-31 10:46:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-01-31 10:46:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2022-01-31 10:46:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2022-01-31 10:46:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-01-31 10:46:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:46:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3317 backedges. 101 proven. 1646 refuted. 0 times theorem prover too weak. 1570 trivial. 0 not checked. [2022-01-31 10:46:56,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:46:56,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354636109] [2022-01-31 10:46:56,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354636109] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:46:56,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453027353] [2022-01-31 10:46:56,789 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 10:46:56,790 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:46:56,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:46:56,790 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:46:56,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-01-31 10:46:57,185 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 10:46:57,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:46:57,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 100 conjunts are in the unsatisfiable core [2022-01-31 10:46:57,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:46:58,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:47:00,927 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-31 10:47:00,927 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 27 treesize of output 26 [2022-01-31 10:47:05,223 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:47:05,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3317 backedges. 189 proven. 1684 refuted. 92 times theorem prover too weak. 1352 trivial. 0 not checked. [2022-01-31 10:47:05,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:47:05,641 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-01-31 10:47:05,642 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 37 treesize of output 33 [2022-01-31 10:47:06,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3317 backedges. 101 proven. 1646 refuted. 0 times theorem prover too weak. 1570 trivial. 0 not checked. [2022-01-31 10:47:06,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453027353] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:47:06,015 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:47:06,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 52] total 102 [2022-01-31 10:47:06,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827001686] [2022-01-31 10:47:06,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:47:06,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-01-31 10:47:06,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:47:06,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-01-31 10:47:06,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=9894, Unknown=2, NotChecked=0, Total=10302 [2022-01-31 10:47:06,017 INFO L87 Difference]: Start difference. First operand 340 states and 343 transitions. Second operand has 102 states, 100 states have (on average 2.79) internal successors, (279), 95 states have internal predecessors, (279), 83 states have call successors, (89), 6 states have call predecessors, (89), 4 states have return successors, (85), 83 states have call predecessors, (85), 81 states have call successors, (85) [2022-01-31 10:47:10,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:47:10,150 INFO L93 Difference]: Finished difference Result 515 states and 521 transitions. [2022-01-31 10:47:10,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-01-31 10:47:10,151 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 100 states have (on average 2.79) internal successors, (279), 95 states have internal predecessors, (279), 83 states have call successors, (89), 6 states have call predecessors, (89), 4 states have return successors, (85), 83 states have call predecessors, (85), 81 states have call successors, (85) Word has length 345 [2022-01-31 10:47:10,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:47:10,152 INFO L225 Difference]: With dead ends: 515 [2022-01-31 10:47:10,152 INFO L226 Difference]: Without dead ends: 515 [2022-01-31 10:47:10,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 884 GetRequests, 681 SyntacticMatches, 49 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9863 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=911, Invalid=23266, Unknown=3, NotChecked=0, Total=24180 [2022-01-31 10:47:10,154 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 208 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 11006 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 11622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 11006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 430 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-01-31 10:47:10,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 1388 Invalid, 11622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 11006 Invalid, 0 Unknown, 430 Unchecked, 2.8s Time] [2022-01-31 10:47:10,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-01-31 10:47:10,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 357. [2022-01-31 10:47:10,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 265 states have (on average 1.0113207547169811) internal successors, (268), 266 states have internal predecessors, (268), 47 states have call successors, (47), 45 states have call predecessors, (47), 44 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2022-01-31 10:47:10,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 361 transitions. [2022-01-31 10:47:10,157 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 361 transitions. Word has length 345 [2022-01-31 10:47:10,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:47:10,158 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 361 transitions. [2022-01-31 10:47:10,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 100 states have (on average 2.79) internal successors, (279), 95 states have internal predecessors, (279), 83 states have call successors, (89), 6 states have call predecessors, (89), 4 states have return successors, (85), 83 states have call predecessors, (85), 81 states have call successors, (85) [2022-01-31 10:47:10,158 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 361 transitions. [2022-01-31 10:47:10,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2022-01-31 10:47:10,159 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:47:10,159 INFO L514 BasicCegarLoop]: trace histogram [23, 23, 23, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:47:10,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0 [2022-01-31 10:47:10,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable73 [2022-01-31 10:47:10,360 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:47:10,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:47:10,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1238171824, now seen corresponding path program 71 times [2022-01-31 10:47:10,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:47:10,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582481602] [2022-01-31 10:47:10,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:47:10,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:47:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:47:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:47:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:47:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:47:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:47:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:47:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:47:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:47:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:47:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:47:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:47:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:47:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:47:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:47:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:47:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:47:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:47:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:47:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 10:47:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-31 10:47:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-01-31 10:47:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-01-31 10:47:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-01-31 10:47:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-01-31 10:47:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:47:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:47:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:47:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:47:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:47:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:47:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:47:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:47:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-01-31 10:47:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-01-31 10:47:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-01-31 10:47:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-01-31 10:47:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-01-31 10:47:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-01-31 10:47:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-01-31 10:47:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-01-31 10:47:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2022-01-31 10:47:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2022-01-31 10:47:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-01-31 10:47:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2022-01-31 10:47:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:11,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 106 proven. 1721 refuted. 0 times theorem prover too weak. 1646 trivial. 0 not checked. [2022-01-31 10:47:11,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:47:11,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582481602] [2022-01-31 10:47:11,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582481602] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:47:11,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702836476] [2022-01-31 10:47:11,486 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 10:47:11,486 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:47:11,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:47:11,487 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:47:11,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-01-31 10:47:11,997 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-01-31 10:47:11,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:47:12,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 101 conjunts are in the unsatisfiable core [2022-01-31 10:47:12,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:47:13,609 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 13 treesize of output 9 [2022-01-31 10:47:16,830 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:47:16,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 66 proven. 1761 refuted. 0 times theorem prover too weak. 1646 trivial. 0 not checked. [2022-01-31 10:47:16,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:47:17,204 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 16 treesize of output 14 [2022-01-31 10:47:17,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 32 treesize of output 28 [2022-01-31 10:47:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 106 proven. 1721 refuted. 0 times theorem prover too weak. 1646 trivial. 0 not checked. [2022-01-31 10:47:17,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702836476] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:47:17,610 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:47:17,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53, 52] total 102 [2022-01-31 10:47:17,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523196474] [2022-01-31 10:47:17,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:47:17,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-01-31 10:47:17,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:47:17,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-01-31 10:47:17,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=9942, Unknown=0, NotChecked=0, Total=10302 [2022-01-31 10:47:17,611 INFO L87 Difference]: Start difference. First operand 357 states and 361 transitions. Second operand has 102 states, 100 states have (on average 2.79) internal successors, (279), 95 states have internal predecessors, (279), 85 states have call successors, (91), 5 states have call predecessors, (91), 3 states have return successors, (87), 85 states have call predecessors, (87), 83 states have call successors, (87) [2022-01-31 10:47:23,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:47:23,730 INFO L93 Difference]: Finished difference Result 533 states and 541 transitions. [2022-01-31 10:47:23,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-01-31 10:47:23,731 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 100 states have (on average 2.79) internal successors, (279), 95 states have internal predecessors, (279), 85 states have call successors, (91), 5 states have call predecessors, (91), 3 states have return successors, (87), 85 states have call predecessors, (87), 83 states have call successors, (87) Word has length 353 [2022-01-31 10:47:23,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:47:23,733 INFO L225 Difference]: With dead ends: 533 [2022-01-31 10:47:23,733 INFO L226 Difference]: Without dead ends: 533 [2022-01-31 10:47:23,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 902 GetRequests, 703 SyntacticMatches, 45 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9448 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=827, Invalid=23353, Unknown=0, NotChecked=0, Total=24180 [2022-01-31 10:47:23,734 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 375 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 18194 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 18990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 18194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 394 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-01-31 10:47:23,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [377 Valid, 1416 Invalid, 18990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 18194 Invalid, 0 Unknown, 394 Unchecked, 5.0s Time] [2022-01-31 10:47:23,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2022-01-31 10:47:23,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 365. [2022-01-31 10:47:23,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 271 states have (on average 1.011070110701107) internal successors, (274), 272 states have internal predecessors, (274), 48 states have call successors, (48), 46 states have call predecessors, (48), 45 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2022-01-31 10:47:23,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 369 transitions. [2022-01-31 10:47:23,738 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 369 transitions. Word has length 353 [2022-01-31 10:47:23,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:47:23,738 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 369 transitions. [2022-01-31 10:47:23,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 100 states have (on average 2.79) internal successors, (279), 95 states have internal predecessors, (279), 85 states have call successors, (91), 5 states have call predecessors, (91), 3 states have return successors, (87), 85 states have call predecessors, (87), 83 states have call successors, (87) [2022-01-31 10:47:23,739 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 369 transitions. [2022-01-31 10:47:23,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2022-01-31 10:47:23,741 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:47:23,742 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 24, 22, 22, 22, 22, 22, 20, 20, 20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:47:23,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Ended with exit code 0 [2022-01-31 10:47:23,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:47:23,955 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:47:23,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:47:23,956 INFO L85 PathProgramCache]: Analyzing trace with hash -165241220, now seen corresponding path program 72 times [2022-01-31 10:47:23,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:47:23,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093048549] [2022-01-31 10:47:23,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:47:23,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:47:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:47:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:47:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:47:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:47:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:47:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:47:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:47:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:47:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:47:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:47:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:47:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:47:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:47:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:47:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:47:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:47:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:47:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:47:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 10:47:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-31 10:47:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-01-31 10:47:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-01-31 10:47:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-01-31 10:47:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-01-31 10:47:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-01-31 10:47:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:47:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:47:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:47:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:47:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:47:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:47:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:47:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-01-31 10:47:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-01-31 10:47:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-01-31 10:47:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-01-31 10:47:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-01-31 10:47:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-01-31 10:47:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-01-31 10:47:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-01-31 10:47:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2022-01-31 10:47:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2022-01-31 10:47:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-01-31 10:47:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2022-01-31 10:47:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:24,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3494 backedges. 101 proven. 1737 refuted. 0 times theorem prover too weak. 1656 trivial. 0 not checked. [2022-01-31 10:47:24,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:47:24,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093048549] [2022-01-31 10:47:24,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093048549] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:47:24,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107598967] [2022-01-31 10:47:24,852 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 10:47:24,853 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:47:24,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:47:24,854 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:47:24,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-01-31 10:47:27,089 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2022-01-31 10:47:27,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:47:27,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 103 conjunts are in the unsatisfiable core [2022-01-31 10:47:27,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:47:28,094 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:47:28,207 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:47:28,208 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:47:28,365 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 10:47:28,366 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 10:47:31,144 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:47:31,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3494 backedges. 230 proven. 1772 refuted. 0 times theorem prover too weak. 1492 trivial. 0 not checked. [2022-01-31 10:47:31,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:47:31,646 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 21 treesize of output 19 [2022-01-31 10:47:31,648 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 37 treesize of output 33 [2022-01-31 10:47:32,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3494 backedges. 101 proven. 1736 refuted. 0 times theorem prover too weak. 1657 trivial. 0 not checked. [2022-01-31 10:47:32,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107598967] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:47:32,028 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:47:32,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53, 53] total 102 [2022-01-31 10:47:32,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068439045] [2022-01-31 10:47:32,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:47:32,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-01-31 10:47:32,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:47:32,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-01-31 10:47:32,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=9916, Unknown=0, NotChecked=0, Total=10302 [2022-01-31 10:47:32,030 INFO L87 Difference]: Start difference. First operand 365 states and 369 transitions. Second operand has 102 states, 100 states have (on average 2.81) internal successors, (281), 95 states have internal predecessors, (281), 84 states have call successors, (91), 5 states have call predecessors, (91), 3 states have return successors, (87), 84 states have call predecessors, (87), 82 states have call successors, (87) [2022-01-31 10:47:36,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:47:36,244 INFO L93 Difference]: Finished difference Result 461 states and 483 transitions. [2022-01-31 10:47:36,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-01-31 10:47:36,245 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 100 states have (on average 2.81) internal successors, (281), 95 states have internal predecessors, (281), 84 states have call successors, (91), 5 states have call predecessors, (91), 3 states have return successors, (87), 84 states have call predecessors, (87), 82 states have call successors, (87) Word has length 353 [2022-01-31 10:47:36,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:47:36,246 INFO L225 Difference]: With dead ends: 461 [2022-01-31 10:47:36,246 INFO L226 Difference]: Without dead ends: 461 [2022-01-31 10:47:36,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 921 GetRequests, 715 SyntacticMatches, 51 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9924 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=859, Invalid=23633, Unknown=0, NotChecked=0, Total=24492 [2022-01-31 10:47:36,248 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 265 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 12382 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 13067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 12382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 493 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-01-31 10:47:36,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 1485 Invalid, 13067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 12382 Invalid, 0 Unknown, 493 Unchecked, 3.2s Time] [2022-01-31 10:47:36,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-01-31 10:47:36,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 439. [2022-01-31 10:47:36,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 326 states have (on average 1.00920245398773) internal successors, (329), 328 states have internal predecessors, (329), 66 states have call successors, (66), 47 states have call predecessors, (66), 46 states have return successors, (65), 63 states have call predecessors, (65), 65 states have call successors, (65) [2022-01-31 10:47:36,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 460 transitions. [2022-01-31 10:47:36,252 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 460 transitions. Word has length 353 [2022-01-31 10:47:36,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:47:36,252 INFO L470 AbstractCegarLoop]: Abstraction has 439 states and 460 transitions. [2022-01-31 10:47:36,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 100 states have (on average 2.81) internal successors, (281), 95 states have internal predecessors, (281), 84 states have call successors, (91), 5 states have call predecessors, (91), 3 states have return successors, (87), 84 states have call predecessors, (87), 82 states have call successors, (87) [2022-01-31 10:47:36,253 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 460 transitions. [2022-01-31 10:47:36,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2022-01-31 10:47:36,254 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:47:36,254 INFO L514 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:47:36,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2022-01-31 10:47:36,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:47:36,471 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:47:36,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:47:36,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1276584386, now seen corresponding path program 73 times [2022-01-31 10:47:36,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:47:36,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891225028] [2022-01-31 10:47:36,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:47:36,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:47:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:47:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:47:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:47:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:47:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:47:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:47:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:47:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:47:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:47:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:47:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:47:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:47:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:47:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:47:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:47:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:47:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:47:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:47:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 10:47:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-31 10:47:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-01-31 10:47:37,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-01-31 10:47:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-01-31 10:47:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-01-31 10:47:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-31 10:47:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:47:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:47:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:47:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:47:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:47:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:47:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:47:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-01-31 10:47:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-01-31 10:47:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-01-31 10:47:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-01-31 10:47:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-01-31 10:47:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-01-31 10:47:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-01-31 10:47:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-01-31 10:47:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2022-01-31 10:47:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2022-01-31 10:47:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-01-31 10:47:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2022-01-31 10:47:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2022-01-31 10:47:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3637 backedges. 843 proven. 942 refuted. 0 times theorem prover too weak. 1852 trivial. 0 not checked. [2022-01-31 10:47:37,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:47:37,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891225028] [2022-01-31 10:47:37,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891225028] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:47:37,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100818951] [2022-01-31 10:47:37,184 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 10:47:37,184 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:47:37,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:47:37,185 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:47:37,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-01-31 10:47:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:37,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 46 conjunts are in the unsatisfiable core [2022-01-31 10:47:37,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:47:38,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3637 backedges. 924 proven. 861 refuted. 0 times theorem prover too weak. 1852 trivial. 0 not checked. [2022-01-31 10:47:38,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:47:38,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3637 backedges. 924 proven. 861 refuted. 0 times theorem prover too weak. 1852 trivial. 0 not checked. [2022-01-31 10:47:38,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100818951] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:47:38,610 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:47:38,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 47] total 72 [2022-01-31 10:47:38,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957427894] [2022-01-31 10:47:38,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:47:38,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-01-31 10:47:38,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:47:38,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-01-31 10:47:38,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1157, Invalid=3955, Unknown=0, NotChecked=0, Total=5112 [2022-01-31 10:47:38,612 INFO L87 Difference]: Start difference. First operand 439 states and 460 transitions. Second operand has 72 states, 72 states have (on average 3.013888888888889) internal successors, (217), 71 states have internal predecessors, (217), 67 states have call successors, (71), 3 states have call predecessors, (71), 1 states have return successors, (68), 66 states have call predecessors, (68), 66 states have call successors, (68) [2022-01-31 10:47:39,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:47:39,590 INFO L93 Difference]: Finished difference Result 463 states and 488 transitions. [2022-01-31 10:47:39,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-31 10:47:39,590 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 3.013888888888889) internal successors, (217), 71 states have internal predecessors, (217), 67 states have call successors, (71), 3 states have call predecessors, (71), 1 states have return successors, (68), 66 states have call predecessors, (68), 66 states have call successors, (68) Word has length 361 [2022-01-31 10:47:39,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:47:39,591 INFO L225 Difference]: With dead ends: 463 [2022-01-31 10:47:39,591 INFO L226 Difference]: Without dead ends: 369 [2022-01-31 10:47:39,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 904 GetRequests, 787 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4049 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2866, Invalid=10940, Unknown=0, NotChecked=0, Total=13806 [2022-01-31 10:47:39,594 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 349 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2109 mSolverCounterSat, 478 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 2587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 478 IncrementalHoareTripleChecker+Valid, 2109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 10:47:39,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [353 Valid, 129 Invalid, 2587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [478 Valid, 2109 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 10:47:39,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-01-31 10:47:39,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 356. [2022-01-31 10:47:39,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 264 states have (on average 1.0075757575757576) internal successors, (266), 265 states have internal predecessors, (266), 47 states have call successors, (47), 45 states have call predecessors, (47), 44 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2022-01-31 10:47:39,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 359 transitions. [2022-01-31 10:47:39,606 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 359 transitions. Word has length 361 [2022-01-31 10:47:39,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:47:39,606 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 359 transitions. [2022-01-31 10:47:39,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 3.013888888888889) internal successors, (217), 71 states have internal predecessors, (217), 67 states have call successors, (71), 3 states have call predecessors, (71), 1 states have return successors, (68), 66 states have call predecessors, (68), 66 states have call successors, (68) [2022-01-31 10:47:39,606 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 359 transitions. [2022-01-31 10:47:39,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2022-01-31 10:47:39,607 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:47:39,607 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 24, 22, 22, 22, 22, 22, 21, 21, 21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:47:39,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2022-01-31 10:47:39,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2022-01-31 10:47:39,810 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:47:39,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:47:39,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1374932082, now seen corresponding path program 74 times [2022-01-31 10:47:39,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:47:39,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534078579] [2022-01-31 10:47:39,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:47:39,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:47:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:47:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:47:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:47:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:47:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:47:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:47:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:47:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:47:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:47:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:47:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:47:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:47:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:47:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:47:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:47:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:47:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:47:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:47:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 10:47:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-31 10:47:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-01-31 10:47:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-01-31 10:47:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-01-31 10:47:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-01-31 10:47:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-01-31 10:47:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:47:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:47:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:47:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:47:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:47:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:47:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:47:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-01-31 10:47:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-01-31 10:47:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-01-31 10:47:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-01-31 10:47:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-01-31 10:47:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-01-31 10:47:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-01-31 10:47:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-01-31 10:47:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2022-01-31 10:47:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2022-01-31 10:47:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-01-31 10:47:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:40,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2022-01-31 10:47:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:41,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2022-01-31 10:47:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:41,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3650 backedges. 106 proven. 1812 refuted. 0 times theorem prover too weak. 1732 trivial. 0 not checked. [2022-01-31 10:47:41,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:47:41,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534078579] [2022-01-31 10:47:41,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534078579] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:47:41,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070620015] [2022-01-31 10:47:41,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 10:47:41,003 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:47:41,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:47:41,004 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:47:41,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-01-31 10:47:41,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 10:47:41,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:47:41,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 104 conjunts are in the unsatisfiable core [2022-01-31 10:47:41,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:47:42,702 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:47:43,404 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-31 10:47:43,405 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 27 treesize of output 26 [2022-01-31 10:47:48,418 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-31 10:47:48,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3650 backedges. 248 proven. 1852 refuted. 108 times theorem prover too weak. 1442 trivial. 0 not checked. [2022-01-31 10:47:48,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:47:48,944 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 21 treesize of output 19 [2022-01-31 10:47:48,946 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 37 treesize of output 33 [2022-01-31 10:47:49,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3650 backedges. 106 proven. 1812 refuted. 0 times theorem prover too weak. 1732 trivial. 0 not checked. [2022-01-31 10:47:49,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070620015] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:47:49,661 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 10:47:49,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55, 54] total 108 [2022-01-31 10:47:49,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318152423] [2022-01-31 10:47:49,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 10:47:49,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-01-31 10:47:49,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:47:49,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-01-31 10:47:49,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=11123, Unknown=1, NotChecked=0, Total=11556 [2022-01-31 10:47:49,663 INFO L87 Difference]: Start difference. First operand 356 states and 359 transitions. Second operand has 108 states, 105 states have (on average 2.780952380952381) internal successors, (292), 100 states have internal predecessors, (292), 88 states have call successors, (94), 6 states have call predecessors, (94), 4 states have return successors, (90), 88 states have call predecessors, (90), 86 states have call successors, (90) [2022-01-31 10:47:55,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:47:55,298 INFO L93 Difference]: Finished difference Result 538 states and 544 transitions. [2022-01-31 10:47:55,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-01-31 10:47:55,299 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 105 states have (on average 2.780952380952381) internal successors, (292), 100 states have internal predecessors, (292), 88 states have call successors, (94), 6 states have call predecessors, (94), 4 states have return successors, (90), 88 states have call predecessors, (90), 86 states have call successors, (90) Word has length 361 [2022-01-31 10:47:55,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:47:55,300 INFO L225 Difference]: With dead ends: 538 [2022-01-31 10:47:55,300 INFO L226 Difference]: Without dead ends: 538 [2022-01-31 10:47:55,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 927 GetRequests, 712 SyntacticMatches, 52 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11120 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=966, Invalid=26092, Unknown=2, NotChecked=0, Total=27060 [2022-01-31 10:47:55,302 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 222 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 11133 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 11864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 11133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 513 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-01-31 10:47:55,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 1411 Invalid, 11864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 11133 Invalid, 0 Unknown, 513 Unchecked, 3.8s Time] [2022-01-31 10:47:55,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-01-31 10:47:55,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 373. [2022-01-31 10:47:55,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 277 states have (on average 1.0108303249097472) internal successors, (280), 278 states have internal predecessors, (280), 49 states have call successors, (49), 47 states have call predecessors, (49), 46 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2022-01-31 10:47:55,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 377 transitions. [2022-01-31 10:47:55,312 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 377 transitions. Word has length 361 [2022-01-31 10:47:55,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:47:55,313 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 377 transitions. [2022-01-31 10:47:55,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 105 states have (on average 2.780952380952381) internal successors, (292), 100 states have internal predecessors, (292), 88 states have call successors, (94), 6 states have call predecessors, (94), 4 states have return successors, (90), 88 states have call predecessors, (90), 86 states have call successors, (90) [2022-01-31 10:47:55,313 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 377 transitions. [2022-01-31 10:47:55,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2022-01-31 10:47:55,314 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:47:55,314 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 24, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:47:55,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Forceful destruction successful, exit code 0 [2022-01-31 10:47:55,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2022-01-31 10:47:55,527 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:47:55,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:47:55,528 INFO L85 PathProgramCache]: Analyzing trace with hash -228813152, now seen corresponding path program 75 times [2022-01-31 10:47:55,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:47:55,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746074687] [2022-01-31 10:47:55,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:47:55,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:47:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:47:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:47:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 10:47:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:47:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 10:47:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 10:47:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 10:47:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 10:47:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 10:47:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 10:47:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 10:47:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 10:47:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 10:47:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 10:47:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 10:47:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-31 10:47:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-31 10:47:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 10:47:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-31 10:47:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-31 10:47:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-01-31 10:47:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-01-31 10:47:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-01-31 10:47:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-01-31 10:47:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-01-31 10:47:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-01-31 10:47:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-31 10:47:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-31 10:47:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-01-31 10:47:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-01-31 10:47:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-01-31 10:47:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-01-31 10:47:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-01-31 10:47:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-01-31 10:47:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-01-31 10:47:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-01-31 10:47:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-01-31 10:47:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-01-31 10:47:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-01-31 10:47:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-01-31 10:47:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2022-01-31 10:47:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2022-01-31 10:47:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-01-31 10:47:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2022-01-31 10:47:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2022-01-31 10:47:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2022-01-31 10:47:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:47:56,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3814 backedges. 111 proven. 1891 refuted. 0 times theorem prover too weak. 1812 trivial. 0 not checked. [2022-01-31 10:47:56,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:47:56,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746074687] [2022-01-31 10:47:56,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746074687] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:47:56,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918696724] [2022-01-31 10:47:56,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 10:47:56,428 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:47:56,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:47:56,429 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 10:47:56,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-01-31 10:48:00,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2022-01-31 10:48:00,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:48:00,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 64 conjunts are in the unsatisfiable core [2022-01-31 10:48:00,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:48:02,027 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 10:48:04,112 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1281| Int) (v_main_~i~0_3441 Int) (|v_main_~#a~0.base_BEFORE_CALL_1281| Int)) (and (< (+ v_main_~i~0_3441 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1281|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1281| (* v_main_~i~0_3441 4)))) (<= v_main_~i~0_3441 22))) is different from true [2022-01-31 10:48:14,368 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1282| Int) (v_main_~i~0_3441 Int) (|v_main_~#a~0.base_BEFORE_CALL_1282| Int)) (and (< (+ v_main_~i~0_3441 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1282|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1282| (* v_main_~i~0_3441 4)))) (<= v_main_~i~0_3441 22))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1281| Int) (|v_main_~#a~0.base_BEFORE_CALL_1281| Int) (v_main_~i~0_3443 Int)) (and (< (+ v_main_~i~0_3443 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1281|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1281| (* v_main_~i~0_3443 4)))) (<= v_main_~i~0_3443 22)))) is different from true [2022-01-31 10:48:18,585 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1283| Int) (v_main_~i~0_3441 Int) (|v_main_~#a~0.base_BEFORE_CALL_1283| Int)) (and (<= v_main_~i~0_3441 22) (< (+ v_main_~i~0_3441 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1283|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1283| (* v_main_~i~0_3441 4)))))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1281| Int) (|v_main_~#a~0.base_BEFORE_CALL_1281| Int) (v_main_~i~0_3443 Int)) (and (< (+ v_main_~i~0_3443 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1281|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1281| (* v_main_~i~0_3443 4)))) (<= v_main_~i~0_3443 22)))) is different from true [2022-01-31 10:48:25,366 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1281| Int) (|v_main_~#a~0.base_BEFORE_CALL_1281| Int) (v_main_~i~0_3443 Int)) (and (< (+ v_main_~i~0_3443 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1281|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1281| (* v_main_~i~0_3443 4)))) (<= v_main_~i~0_3443 22))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1284| Int) (v_main_~i~0_3441 Int) (|v_main_~#a~0.base_BEFORE_CALL_1284| Int)) (and (<= v_main_~i~0_3441 22) (< (+ v_main_~i~0_3441 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1284|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1284| (* v_main_~i~0_3441 4))))))) is different from true [2022-01-31 10:48:35,656 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_1285| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1285| Int) (v_main_~i~0_3441 Int)) (and (<= v_main_~i~0_3441 22) (< (+ v_main_~i~0_3441 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1285|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1285| (* v_main_~i~0_3441 4)))))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1281| Int) (|v_main_~#a~0.base_BEFORE_CALL_1281| Int) (v_main_~i~0_3443 Int)) (and (< (+ v_main_~i~0_3443 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1281|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1281| (* v_main_~i~0_3443 4)))) (<= v_main_~i~0_3443 22)))) is different from true [2022-01-31 10:48:39,945 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_1286| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1286| Int) (v_main_~i~0_3441 Int)) (and (<= v_main_~i~0_3441 22) (< (+ v_main_~i~0_3441 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1286|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1286| (* v_main_~i~0_3441 4)))))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1281| Int) (|v_main_~#a~0.base_BEFORE_CALL_1281| Int) (v_main_~i~0_3443 Int)) (and (< (+ v_main_~i~0_3443 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1281|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1281| (* v_main_~i~0_3443 4)))) (<= v_main_~i~0_3443 22)))) is different from true [2022-01-31 10:48:52,261 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1281| Int) (|v_main_~#a~0.base_BEFORE_CALL_1281| Int) (v_main_~i~0_3443 Int)) (and (< (+ v_main_~i~0_3443 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1281|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1281| (* v_main_~i~0_3443 4)))) (<= v_main_~i~0_3443 22))) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1287| Int) (v_main_~i~0_3441 Int) (|v_main_~#a~0.offset_BEFORE_CALL_1287| Int)) (and (<= v_main_~i~0_3441 22) (< (+ v_main_~i~0_3441 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1287|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1287| (* v_main_~i~0_3441 4))))))) is different from true [2022-01-31 10:48:56,553 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_main_~#a~0.base_BEFORE_CALL_1288| Int) (v_main_~i~0_3441 Int) (|v_main_~#a~0.offset_BEFORE_CALL_1288| Int)) (and (< (+ v_main_~i~0_3441 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1288|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1288| (* v_main_~i~0_3441 4)))) (<= v_main_~i~0_3441 22))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1281| Int) (|v_main_~#a~0.base_BEFORE_CALL_1281| Int) (v_main_~i~0_3443 Int)) (and (< (+ v_main_~i~0_3443 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1281|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1281| (* v_main_~i~0_3443 4)))) (<= v_main_~i~0_3443 22)))) is different from true [2022-01-31 10:48:58,828 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_1289| Int) (v_main_~i~0_3441 Int) (|v_main_~#a~0.offset_BEFORE_CALL_1289| Int)) (and (<= v_main_~i~0_3441 22) (< (+ v_main_~i~0_3441 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1289|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1289| (* v_main_~i~0_3441 4)))))) is different from true [2022-01-31 10:49:22,916 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.offset_BEFORE_CALL_1290| Int) (|v_main_~#a~0.base_BEFORE_CALL_1290| Int) (v_main_~i~0_3441 Int)) (and (<= v_main_~i~0_3441 22) (< (+ v_main_~i~0_3441 1) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1290|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1290| (* v_main_~i~0_3441 4)))))) is different from true