/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-fpi/sina2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 11:49:11,283 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 11:49:11,284 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 11:49:11,340 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 11:49:11,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 11:49:11,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 11:49:11,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 11:49:11,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 11:49:11,350 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 11:49:11,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 11:49:11,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 11:49:11,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 11:49:11,352 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 11:49:11,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 11:49:11,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 11:49:11,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 11:49:11,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 11:49:11,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 11:49:11,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 11:49:11,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 11:49:11,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 11:49:11,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 11:49:11,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 11:49:11,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 11:49:11,372 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 11:49:11,372 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 11:49:11,372 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 11:49:11,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 11:49:11,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 11:49:11,373 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 11:49:11,374 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 11:49:11,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 11:49:11,374 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 11:49:11,375 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 11:49:11,375 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 11:49:11,376 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 11:49:11,376 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 11:49:11,376 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 11:49:11,376 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 11:49:11,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 11:49:11,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 11:49:11,381 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 11:49:11,391 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 11:49:11,391 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 11:49:11,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 11:49:11,392 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 11:49:11,392 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 11:49:11,392 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 11:49:11,392 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 11:49:11,392 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 11:49:11,392 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 11:49:11,392 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 11:49:11,393 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 11:49:11,393 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 11:49:11,393 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 11:49:11,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 11:49:11,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 11:49:11,393 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 11:49:11,393 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 11:49:11,393 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 11:49:11,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:49:11,393 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 11:49:11,394 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 11:49:11,394 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 11:49:11,394 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 11:49:11,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 11:49:11,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 11:49:11,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 11:49:11,595 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 11:49:11,596 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 11:49:11,596 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/sina2.c [2022-01-31 11:49:11,640 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbd73e0d3/3a5eeff2046945509970632d1d523643/FLAG76ab28193 [2022-01-31 11:49:11,993 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 11:49:11,993 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina2.c [2022-01-31 11:49:12,000 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbd73e0d3/3a5eeff2046945509970632d1d523643/FLAG76ab28193 [2022-01-31 11:49:12,010 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbd73e0d3/3a5eeff2046945509970632d1d523643 [2022-01-31 11:49:12,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 11:49:12,013 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 11:49:12,016 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 11:49:12,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 11:49:12,019 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 11:49:12,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:49:12" (1/1) ... [2022-01-31 11:49:12,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7984aba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:49:12, skipping insertion in model container [2022-01-31 11:49:12,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:49:12" (1/1) ... [2022-01-31 11:49:12,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 11:49:12,033 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 11:49:12,153 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-fpi/sina2.c[588,601] [2022-01-31 11:49:12,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:49:12,180 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 11:49:12,219 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-fpi/sina2.c[588,601] [2022-01-31 11:49:12,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:49:12,242 INFO L208 MainTranslator]: Completed translation [2022-01-31 11:49:12,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:49:12 WrapperNode [2022-01-31 11:49:12,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 11:49:12,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 11:49:12,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 11:49:12,244 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 11:49:12,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:49:12" (1/1) ... [2022-01-31 11:49:12,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:49:12" (1/1) ... [2022-01-31 11:49:12,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:49:12" (1/1) ... [2022-01-31 11:49:12,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:49:12" (1/1) ... [2022-01-31 11:49:12,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:49:12" (1/1) ... [2022-01-31 11:49:12,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:49:12" (1/1) ... [2022-01-31 11:49:12,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:49:12" (1/1) ... [2022-01-31 11:49:12,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 11:49:12,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 11:49:12,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 11:49:12,282 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 11:49:12,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:49:12" (1/1) ... [2022-01-31 11:49:12,288 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:49:12,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:49:12,303 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 11:49:12,325 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 11:49:12,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 11:49:12,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 11:49:12,338 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 11:49:12,338 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 11:49:12,338 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 11:49:12,339 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 11:49:12,339 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 11:49:12,339 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 11:49:12,339 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 11:49:12,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 11:49:12,339 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 11:49:12,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 11:49:12,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 11:49:12,340 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 11:49:12,340 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 11:49:12,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 11:49:12,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 11:49:12,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 11:49:12,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 11:49:12,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 11:49:12,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 11:49:12,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 11:49:12,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 11:49:12,396 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 11:49:12,397 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 11:49:12,488 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 11:49:12,492 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 11:49:12,492 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-31 11:49:12,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:49:12 BoogieIcfgContainer [2022-01-31 11:49:12,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 11:49:12,493 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 11:49:12,494 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 11:49:12,494 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 11:49:12,496 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:49:12" (1/1) ... [2022-01-31 11:49:12,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:49:12 BasicIcfg [2022-01-31 11:49:12,507 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 11:49:12,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 11:49:12,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 11:49:12,510 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 11:49:12,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:49:12" (1/4) ... [2022-01-31 11:49:12,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e29aa0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:49:12, skipping insertion in model container [2022-01-31 11:49:12,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:49:12" (2/4) ... [2022-01-31 11:49:12,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e29aa0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:49:12, skipping insertion in model container [2022-01-31 11:49:12,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:49:12" (3/4) ... [2022-01-31 11:49:12,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e29aa0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 11:49:12, skipping insertion in model container [2022-01-31 11:49:12,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:49:12" (4/4) ... [2022-01-31 11:49:12,512 INFO L111 eAbstractionObserver]: Analyzing ICFG sina2.cJordan [2022-01-31 11:49:12,517 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 11:49:12,517 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 11:49:12,550 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 11:49:12,556 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 11:49:12,556 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 11:49:12,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:49:12,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-31 11:49:12,570 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:49:12,570 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:49:12,570 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:49:12,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:49:12,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1511364421, now seen corresponding path program 1 times [2022-01-31 11:49:12,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:49:12,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978271923] [2022-01-31 11:49:12,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:49:12,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:49:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:12,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:49:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:12,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:49:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:12,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:12,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:49:12,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978271923] [2022-01-31 11:49:12,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978271923] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:49:12,779 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:49:12,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 11:49:12,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081339544] [2022-01-31 11:49:12,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:49:12,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 11:49:12,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:49:12,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 11:49:12,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 11:49:12,808 INFO L87 Difference]: Start difference. First operand has 37 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:49:12,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:49:12,886 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-01-31 11:49:12,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 11:49:12,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-01-31 11:49:12,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:49:12,892 INFO L225 Difference]: With dead ends: 37 [2022-01-31 11:49:12,892 INFO L226 Difference]: Without dead ends: 32 [2022-01-31 11:49:12,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 11:49:12,895 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:49:12,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 45 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:49:12,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-31 11:49:12,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-01-31 11:49:12,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 11:49:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-01-31 11:49:12,938 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 24 [2022-01-31 11:49:12,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:49:12,938 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-01-31 11:49:12,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:49:12,939 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-01-31 11:49:12,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-31 11:49:12,940 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:49:12,940 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:49:12,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 11:49:12,940 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:49:12,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:49:12,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1574252543, now seen corresponding path program 1 times [2022-01-31 11:49:12,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:49:12,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005903163] [2022-01-31 11:49:12,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:49:12,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:49:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:13,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:49:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:13,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:49:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:13,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:13,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:49:13,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005903163] [2022-01-31 11:49:13,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005903163] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:49:13,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:49:13,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 11:49:13,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133341870] [2022-01-31 11:49:13,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:49:13,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 11:49:13,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:49:13,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 11:49:13,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 11:49:13,062 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:49:13,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:49:13,130 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-01-31 11:49:13,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 11:49:13,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-01-31 11:49:13,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:49:13,132 INFO L225 Difference]: With dead ends: 42 [2022-01-31 11:49:13,132 INFO L226 Difference]: Without dead ends: 42 [2022-01-31 11:49:13,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 11:49:13,133 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 44 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:49:13,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 28 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:49:13,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-31 11:49:13,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2022-01-31 11:49:13,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 11:49:13,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-01-31 11:49:13,139 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 24 [2022-01-31 11:49:13,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:49:13,139 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-01-31 11:49:13,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:49:13,140 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-01-31 11:49:13,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 11:49:13,140 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:49:13,140 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:49:13,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 11:49:13,141 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:49:13,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:49:13,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1521490391, now seen corresponding path program 1 times [2022-01-31 11:49:13,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:49:13,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998748734] [2022-01-31 11:49:13,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:49:13,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:49:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:13,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:49:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:13,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:49:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:13,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:13,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:49:13,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998748734] [2022-01-31 11:49:13,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998748734] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:49:13,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694340075] [2022-01-31 11:49:13,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:49:13,709 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:49:13,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:49:13,711 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 11:49:13,732 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 11:49:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:13,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-31 11:49:13,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:49:13,892 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 11:49:13,902 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:49:13,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:49:14,027 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-01-31 11:49:14,119 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2022-01-31 11:49:14,274 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-01-31 11:49:14,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:14,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:49:14,542 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:14,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:14,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694340075] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:49:14,581 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:49:14,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 31 [2022-01-31 11:49:14,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858681464] [2022-01-31 11:49:14,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:49:14,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-31 11:49:14,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:49:14,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-31 11:49:14,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2022-01-31 11:49:14,585 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 31 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 28 states have internal predecessors, (53), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 11:49:14,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:49:14,972 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2022-01-31 11:49:14,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 11:49:14,973 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 28 states have internal predecessors, (53), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-01-31 11:49:14,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:49:14,974 INFO L225 Difference]: With dead ends: 58 [2022-01-31 11:49:14,974 INFO L226 Difference]: Without dead ends: 58 [2022-01-31 11:49:14,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 45 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=1159, Unknown=0, NotChecked=0, Total=1332 [2022-01-31 11:49:14,975 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:49:14,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 157 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 466 Invalid, 0 Unknown, 12 Unchecked, 0.2s Time] [2022-01-31 11:49:14,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-31 11:49:14,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2022-01-31 11:49:14,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 43 states have internal predecessors, (49), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:49:14,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2022-01-31 11:49:14,981 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 30 [2022-01-31 11:49:14,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:49:14,981 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2022-01-31 11:49:14,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 28 states have internal predecessors, (53), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 11:49:14,982 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-01-31 11:49:14,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 11:49:14,982 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:49:14,982 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:49:15,001 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 11:49:15,195 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 11:49:15,196 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:49:15,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:49:15,196 INFO L85 PathProgramCache]: Analyzing trace with hash 593098613, now seen corresponding path program 2 times [2022-01-31 11:49:15,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:49:15,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267427075] [2022-01-31 11:49:15,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:49:15,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:49:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:15,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:49:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:15,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:49:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:15,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:49:15,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:49:15,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267427075] [2022-01-31 11:49:15,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267427075] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:49:15,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629593060] [2022-01-31 11:49:15,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:49:15,290 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:49:15,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:49:15,295 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 11:49:15,296 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 11:49:15,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:49:15,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:49:15,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:49:15,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:49:15,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:49:15,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:49:15,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:49:15,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629593060] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:49:15,452 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:49:15,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 11:49:15,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265210732] [2022-01-31 11:49:15,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:49:15,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:49:15,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:49:15,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:49:15,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:49:15,453 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:49:15,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:49:15,589 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-01-31 11:49:15,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:49:15,590 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-01-31 11:49:15,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:49:15,590 INFO L225 Difference]: With dead ends: 84 [2022-01-31 11:49:15,590 INFO L226 Difference]: Without dead ends: 64 [2022-01-31 11:49:15,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:49:15,591 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 65 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:49:15,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 66 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:49:15,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-31 11:49:15,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2022-01-31 11:49:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 11:49:15,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-01-31 11:49:15,596 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 32 [2022-01-31 11:49:15,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:49:15,596 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-01-31 11:49:15,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:49:15,596 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-01-31 11:49:15,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 11:49:15,597 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:49:15,597 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:49:15,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-31 11:49:15,814 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 11:49:15,814 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:49:15,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:49:15,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1091680173, now seen corresponding path program 3 times [2022-01-31 11:49:15,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:49:15,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276466956] [2022-01-31 11:49:15,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:49:15,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:49:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:15,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:49:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:15,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:49:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:15,871 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:49:15,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:49:15,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276466956] [2022-01-31 11:49:15,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276466956] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:49:15,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998112937] [2022-01-31 11:49:15,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:49:15,871 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:49:15,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:49:15,896 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 11:49:15,936 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 11:49:15,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 11:49:15,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:49:15,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:49:15,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:49:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:49:16,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:49:16,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:49:16,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998112937] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:49:16,077 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:49:16,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 11:49:16,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617464109] [2022-01-31 11:49:16,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:49:16,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:49:16,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:49:16,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:49:16,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:49:16,078 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:49:16,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:49:16,208 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-01-31 11:49:16,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:49:16,209 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), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-01-31 11:49:16,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:49:16,209 INFO L225 Difference]: With dead ends: 51 [2022-01-31 11:49:16,209 INFO L226 Difference]: Without dead ends: 51 [2022-01-31 11:49:16,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-01-31 11:49:16,210 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 62 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:49:16,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 65 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:49:16,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-01-31 11:49:16,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2022-01-31 11:49:16,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 11:49:16,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-01-31 11:49:16,214 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 32 [2022-01-31 11:49:16,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:49:16,214 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-01-31 11:49:16,214 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), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:49:16,214 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-01-31 11:49:16,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 11:49:16,215 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:49:16,215 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:49:16,237 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 11:49:16,431 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 11:49:16,432 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:49:16,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:49:16,432 INFO L85 PathProgramCache]: Analyzing trace with hash -2083872081, now seen corresponding path program 4 times [2022-01-31 11:49:16,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:49:16,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978563050] [2022-01-31 11:49:16,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:49:16,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:49:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:17,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:49:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:17,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:49:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:17,087 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:17,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:49:17,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978563050] [2022-01-31 11:49:17,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978563050] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:49:17,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181559965] [2022-01-31 11:49:17,087 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:49:17,088 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:49:17,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:49:17,102 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 11:49:17,121 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 11:49:17,180 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:49:17,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:49:17,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 51 conjunts are in the unsatisfiable core [2022-01-31 11:49:17,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:49:17,204 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:49:17,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:17,237 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:49:17,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:17,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:17,309 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-01-31 11:49:17,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:17,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:17,477 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:17,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-01-31 11:49:17,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:17,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:17,584 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-01-31 11:49:17,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:17,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:17,716 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:17,716 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 41 [2022-01-31 11:49:17,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:17,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:17,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:17,839 INFO L353 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-01-31 11:49:17,839 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 54 [2022-01-31 11:49:17,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:17,981 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-01-31 11:49:18,041 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:18,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:49:20,205 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_55 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_55)) (forall ((v_ArrVal_160 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_55 8)) v_ArrVal_160) c_main_~a~0.offset) (+ c_~N~0 1))))) is different from false [2022-01-31 11:49:20,633 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_55 Int) (v_ArrVal_160 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_55)) (= (select (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ c_main_~a~0.offset (* c_main_~i~0 8)))) (store .cse0 .cse1 (+ (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse0 .cse1)))) (+ c_main_~a~0.offset (* v_main_~i~0_55 8)) v_ArrVal_160) c_main_~a~0.offset) (+ c_~N~0 1)))) is different from false [2022-01-31 11:49:21,548 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-01-31 11:49:21,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181559965] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:49:21,548 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:49:21,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 20] total 56 [2022-01-31 11:49:21,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801488457] [2022-01-31 11:49:21,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:49:21,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-01-31 11:49:21,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:49:21,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-01-31 11:49:21,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=2600, Unknown=2, NotChecked=210, Total=3080 [2022-01-31 11:49:21,551 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 56 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 53 states have internal predecessors, (73), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:49:23,887 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse0 (select .cse2 (+ c_main_~a~0.offset (* c_main_~i~0 8)))) (.cse1 (select .cse2 (+ c_main_~a~0.offset 8)))) (and (<= c_~N~0 2) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (and (= (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 1)) (< (+ c_main_~a~0.base 1) |main_~#sum~0.base|))) (forall ((v_main_~i~0_55 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_55)) (forall ((v_ArrVal_160 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_55 8)) v_ArrVal_160) c_main_~a~0.offset) (+ c_~N~0 1))))) (= c_main_~i~0 0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (< 1 c_~N~0) (= .cse0 (+ c_~N~0 1)) (= .cse0 (+ .cse1 2)) (= .cse1 1)))) is different from false [2022-01-31 11:49:24,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:49:24,078 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-01-31 11:49:24,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 11:49:24,079 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 53 states have internal predecessors, (73), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-01-31 11:49:24,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:49:24,079 INFO L225 Difference]: With dead ends: 65 [2022-01-31 11:49:24,080 INFO L226 Difference]: Without dead ends: 65 [2022-01-31 11:49:24,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1379 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=325, Invalid=3344, Unknown=3, NotChecked=360, Total=4032 [2022-01-31 11:49:24,081 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 535 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:49:24,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 271 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 551 Invalid, 0 Unknown, 535 Unchecked, 0.3s Time] [2022-01-31 11:49:24,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-31 11:49:24,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2022-01-31 11:49:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 53 states have internal predecessors, (59), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:49:24,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-01-31 11:49:24,086 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 36 [2022-01-31 11:49:24,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:49:24,086 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-01-31 11:49:24,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 53 states have internal predecessors, (73), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:49:24,086 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-01-31 11:49:24,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 11:49:24,087 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:49:24,087 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:49:24,104 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 11:49:24,303 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 11:49:24,303 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:49:24,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:49:24,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1878370893, now seen corresponding path program 5 times [2022-01-31 11:49:24,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:49:24,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819282149] [2022-01-31 11:49:24,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:49:24,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:49:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:24,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:49:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:24,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:49:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:49:24,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:49:24,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819282149] [2022-01-31 11:49:24,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819282149] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:49:24,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801972678] [2022-01-31 11:49:24,364 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:49:24,364 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:49:24,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:49:24,365 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 11:49:24,366 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 11:49:24,421 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-31 11:49:24,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:49:24,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:49:24,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:49:24,521 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:49:24,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:49:24,592 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:49:24,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801972678] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:49:24,593 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:49:24,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 11:49:24,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116970856] [2022-01-31 11:49:24,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:49:24,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:49:24,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:49:24,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:49:24,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:49:24,594 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:49:24,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:49:24,767 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2022-01-31 11:49:24,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 11:49:24,768 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2022-01-31 11:49:24,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:49:24,769 INFO L225 Difference]: With dead ends: 104 [2022-01-31 11:49:24,769 INFO L226 Difference]: Without dead ends: 101 [2022-01-31 11:49:24,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-01-31 11:49:24,770 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 82 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:49:24,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 73 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:49:24,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-01-31 11:49:24,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83. [2022-01-31 11:49:24,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 72 states have internal predecessors, (78), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 11:49:24,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2022-01-31 11:49:24,775 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 38 [2022-01-31 11:49:24,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:49:24,776 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2022-01-31 11:49:24,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:49:24,776 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2022-01-31 11:49:24,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 11:49:24,776 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:49:24,777 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:49:24,794 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 11:49:24,987 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 11:49:24,987 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:49:24,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:49:24,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1068696619, now seen corresponding path program 6 times [2022-01-31 11:49:24,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:49:24,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097718056] [2022-01-31 11:49:24,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:49:24,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:49:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:25,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:49:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:25,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:49:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:25,051 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:49:25,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:49:25,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097718056] [2022-01-31 11:49:25,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097718056] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:49:25,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816628841] [2022-01-31 11:49:25,051 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:49:25,051 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:49:25,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:49:25,068 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 11:49:25,094 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 11:49:25,123 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-31 11:49:25,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:49:25,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:49:25,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:49:25,221 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:49:25,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:49:25,296 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:49:25,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816628841] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:49:25,296 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:49:25,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 11:49:25,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432938478] [2022-01-31 11:49:25,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:49:25,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:49:25,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:49:25,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:49:25,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:49:25,298 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:49:25,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:49:25,507 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2022-01-31 11:49:25,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 11:49:25,507 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2022-01-31 11:49:25,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:49:25,508 INFO L225 Difference]: With dead ends: 90 [2022-01-31 11:49:25,508 INFO L226 Difference]: Without dead ends: 88 [2022-01-31 11:49:25,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2022-01-31 11:49:25,508 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 91 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:49:25,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 75 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:49:25,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-01-31 11:49:25,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 72. [2022-01-31 11:49:25,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:49:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2022-01-31 11:49:25,513 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 38 [2022-01-31 11:49:25,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:49:25,513 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2022-01-31 11:49:25,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:49:25,513 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-01-31 11:49:25,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 11:49:25,514 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:49:25,514 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:49:25,533 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 11:49:25,723 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 11:49:25,723 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:49:25,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:49:25,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1358624121, now seen corresponding path program 7 times [2022-01-31 11:49:25,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:49:25,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875118044] [2022-01-31 11:49:25,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:49:25,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:49:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:26,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:49:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:26,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:49:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:26,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:49:26,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875118044] [2022-01-31 11:49:26,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875118044] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:49:26,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24717168] [2022-01-31 11:49:26,662 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 11:49:26,662 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:49:26,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:49:26,663 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 11:49:26,711 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 11:49:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:26,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 71 conjunts are in the unsatisfiable core [2022-01-31 11:49:26,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:49:26,768 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 11:49:26,774 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:49:26,785 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:49:26,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:26,811 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-01-31 11:49:26,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:26,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:26,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-01-31 11:49:27,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:27,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:27,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:27,033 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 52 [2022-01-31 11:49:27,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:27,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:27,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:27,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:27,161 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:27,161 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 59 [2022-01-31 11:49:27,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:27,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:27,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:27,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:27,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:27,339 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:27,340 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52 [2022-01-31 11:49:27,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:27,509 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:27,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:27,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:27,512 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 56 [2022-01-31 11:49:27,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:27,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:27,656 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:27,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:27,658 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 59 [2022-01-31 11:49:27,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:27,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:27,782 INFO L353 Elim1Store]: treesize reduction 30, result has 42.3 percent of original size [2022-01-31 11:49:27,782 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 57 [2022-01-31 11:49:27,951 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-01-31 11:49:28,038 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:28,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:49:30,169 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_102 Int)) (or (forall ((v_ArrVal_316 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_102)) v_ArrVal_316) c_main_~a~0.offset) (+ c_~N~0 1))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_102)))) is different from false [2022-01-31 11:50:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-31 11:50:04,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24717168] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:50:04,300 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:50:04,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26, 26] total 65 [2022-01-31 11:50:04,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415976468] [2022-01-31 11:50:04,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:50:04,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-01-31 11:50:04,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:50:04,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-01-31 11:50:04,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=3645, Unknown=78, NotChecked=124, Total=4160 [2022-01-31 11:50:04,302 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 65 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 62 states have internal predecessors, (84), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:50:06,771 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (= (select .cse0 (+ c_main_~a~0.offset (* c_~N~0 8) (- 8))) 1) (= 0 (+ (- 1) c_main_~i~0)) (forall ((v_main_~i~0_102 Int)) (or (forall ((v_ArrVal_316 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_102)) v_ArrVal_316) c_main_~a~0.offset) (+ c_~N~0 1))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_102)))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select .cse0 0) (+ c_~N~0 1)) (= c_main_~a~0.offset 0) (<= 3 c_~N~0) (= (select .cse0 (+ c_main_~a~0.offset (* c_main_~i~0 8) (- 8))) 4) (<= c_~N~0 3) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (and (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 3))) (<= (+ (div (* (- 1) c_main_~a~0.offset) 8) 1) c_main_~i~0))) is different from false [2022-01-31 11:50:08,835 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (forall ((v_main_~i~0_102 Int)) (or (forall ((v_ArrVal_316 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_102)) v_ArrVal_316) c_main_~a~0.offset) (+ c_~N~0 1))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_102)))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select .cse0 0) (+ c_~N~0 1)) (= c_main_~a~0.offset 0) (<= 3 c_~N~0) (= (select .cse0 c_main_~a~0.offset) 4) (<= c_~N~0 3) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (and (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 3))) (<= (+ (div (* (- 1) c_main_~a~0.offset) 8) 1) c_main_~i~0))) is different from false [2022-01-31 11:50:11,035 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_102 Int)) (or (forall ((v_ArrVal_316 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_102)) v_ArrVal_316) c_main_~a~0.offset) (+ c_~N~0 1))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_102)))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select (select |c_#memory_int| c_main_~a~0.base) 0) (+ c_~N~0 1)) (= c_main_~a~0.offset 0) (<= (+ (div (* (- 1) c_main_~a~0.offset) 8) 1) c_main_~i~0)) is different from false [2022-01-31 11:50:11,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:50:11,190 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2022-01-31 11:50:11,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-01-31 11:50:11,190 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 62 states have internal predecessors, (84), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-01-31 11:50:11,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:50:11,191 INFO L225 Difference]: With dead ends: 105 [2022-01-31 11:50:11,191 INFO L226 Difference]: Without dead ends: 105 [2022-01-31 11:50:11,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 46 SyntacticMatches, 8 SemanticMatches, 75 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1779 ImplicationChecksByTransitivity, 43.4s TimeCoverageRelationStatistics Valid=407, Invalid=4784, Unknown=81, NotChecked=580, Total=5852 [2022-01-31 11:50:11,193 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 30 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 985 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:50:11,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 397 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 624 Invalid, 0 Unknown, 985 Unchecked, 0.3s Time] [2022-01-31 11:50:11,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-01-31 11:50:11,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2022-01-31 11:50:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 84 states have (on average 1.0952380952380953) internal successors, (92), 85 states have internal predecessors, (92), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 11:50:11,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2022-01-31 11:50:11,198 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 42 [2022-01-31 11:50:11,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:50:11,198 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2022-01-31 11:50:11,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 62 states have internal predecessors, (84), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:50:11,199 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2022-01-31 11:50:11,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 11:50:11,199 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:50:11,199 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:50:11,216 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 11:50:11,400 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 11:50:11,400 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:50:11,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:50:11,401 INFO L85 PathProgramCache]: Analyzing trace with hash -188567964, now seen corresponding path program 1 times [2022-01-31 11:50:11,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:50:11,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599937754] [2022-01-31 11:50:11,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:50:11,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:50:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:12,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:50:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:12,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:50:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:12,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 11:50:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:12,194 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:50:12,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:50:12,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599937754] [2022-01-31 11:50:12,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599937754] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:50:12,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682590434] [2022-01-31 11:50:12,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:50:12,195 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:50:12,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:50:12,208 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 11:50:12,209 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 11:50:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:12,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 62 conjunts are in the unsatisfiable core [2022-01-31 11:50:12,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:50:12,288 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 11:50:12,293 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:50:12,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:50:12,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:12,391 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-01-31 11:50:12,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:12,568 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:50:12,569 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2022-01-31 11:50:12,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:12,650 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2022-01-31 11:50:12,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:12,759 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:50:12,760 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 41 [2022-01-31 11:50:12,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:12,853 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 39 [2022-01-31 11:50:18,369 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 26 [2022-01-31 11:50:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:50:18,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:50:32,973 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:50:32,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682590434] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:50:32,973 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:50:32,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26, 25] total 68 [2022-01-31 11:50:32,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158346248] [2022-01-31 11:50:32,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:50:32,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-01-31 11:50:32,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:50:32,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-01-31 11:50:32,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=427, Invalid=4117, Unknown=12, NotChecked=0, Total=4556 [2022-01-31 11:50:32,975 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 68 states, 64 states have (on average 1.421875) internal successors, (91), 64 states have internal predecessors, (91), 6 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 11:50:50,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:50:50,678 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2022-01-31 11:50:50,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-01-31 11:50:50,678 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 64 states have (on average 1.421875) internal successors, (91), 64 states have internal predecessors, (91), 6 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2022-01-31 11:50:50,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:50:50,678 INFO L225 Difference]: With dead ends: 97 [2022-01-31 11:50:50,679 INFO L226 Difference]: Without dead ends: 72 [2022-01-31 11:50:50,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2510 ImplicationChecksByTransitivity, 37.1s TimeCoverageRelationStatistics Valid=739, Invalid=6726, Unknown=17, NotChecked=0, Total=7482 [2022-01-31 11:50:50,680 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 39 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 264 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 11:50:50,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 383 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 458 Invalid, 0 Unknown, 264 Unchecked, 0.6s Time] [2022-01-31 11:50:50,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-31 11:50:50,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-01-31 11:50:50,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 63 states have internal predecessors, (69), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:50:50,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2022-01-31 11:50:50,683 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 44 [2022-01-31 11:50:50,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:50:50,683 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2022-01-31 11:50:50,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 64 states have (on average 1.421875) internal successors, (91), 64 states have internal predecessors, (91), 6 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 11:50:50,684 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-01-31 11:50:50,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 11:50:50,684 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:50:50,684 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 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 11:50:50,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-31 11:50:50,884 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 11:50:50,887 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:50:50,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:50:50,887 INFO L85 PathProgramCache]: Analyzing trace with hash -2112225083, now seen corresponding path program 8 times [2022-01-31 11:50:50,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:50:50,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662914887] [2022-01-31 11:50:50,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:50:50,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:50:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:51,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:50:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:51,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:50:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:51,112 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 11:50:51,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:50:51,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662914887] [2022-01-31 11:50:51,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662914887] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:50:51,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514291661] [2022-01-31 11:50:51,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:50:51,113 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:50:51,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:50:51,114 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 11:50:51,115 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 11:50:51,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:50:51,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:50:51,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:50:51,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:50:51,463 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 11:50:51,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:50:51,687 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 11:50:51,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514291661] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:50:51,687 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:50:51,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2022-01-31 11:50:51,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121822457] [2022-01-31 11:50:51,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:50:51,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 11:50:51,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:50:51,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 11:50:51,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2022-01-31 11:50:51,689 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 25 states, 25 states have (on average 2.6) internal successors, (65), 24 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:50:53,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:50:53,256 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2022-01-31 11:50:53,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 11:50:53,257 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 24 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-01-31 11:50:53,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:50:53,257 INFO L225 Difference]: With dead ends: 112 [2022-01-31 11:50:53,257 INFO L226 Difference]: Without dead ends: 109 [2022-01-31 11:50:53,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=317, Invalid=1753, Unknown=0, NotChecked=0, Total=2070 [2022-01-31 11:50:53,258 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 203 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:50:53,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 180 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 11:50:53,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-01-31 11:50:53,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 88. [2022-01-31 11:50:53,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 75 states have (on average 1.08) internal successors, (81), 76 states have internal predecessors, (81), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 11:50:53,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2022-01-31 11:50:53,265 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 44 [2022-01-31 11:50:53,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:50:53,265 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2022-01-31 11:50:53,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 24 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:50:53,265 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2022-01-31 11:50:53,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 11:50:53,266 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:50:53,266 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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 11:50:53,285 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 11:50:53,475 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 11:50:53,475 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:50:53,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:50:53,476 INFO L85 PathProgramCache]: Analyzing trace with hash -665874081, now seen corresponding path program 9 times [2022-01-31 11:50:53,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:50:53,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898524390] [2022-01-31 11:50:53,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:50:53,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:50:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:56,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:50:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:56,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:50:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:56,490 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:50:56,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:50:56,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898524390] [2022-01-31 11:50:56,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898524390] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:50:56,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93162320] [2022-01-31 11:50:56,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:50:56,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:50:56,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:50:56,493 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 11:50:56,495 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 11:50:56,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 11:50:56,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:50:56,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 88 conjunts are in the unsatisfiable core [2022-01-31 11:50:56,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:50:56,606 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 11:50:56,617 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:50:56,641 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:50:56,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:56,705 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-01-31 11:50:56,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:56,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:56,781 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-01-31 11:50:56,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:56,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:56,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:56,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:56,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:56,899 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 57 [2022-01-31 11:50:57,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:57,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:57,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:57,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:57,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:57,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:57,389 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2022-01-31 11:50:57,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:57,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:57,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:57,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:57,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:57,691 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:50:57,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:57,694 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2022-01-31 11:50:57,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:57,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:57,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:57,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:57,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:57,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:57,890 INFO L353 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2022-01-31 11:50:57,890 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 78 [2022-01-31 11:50:58,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:58,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:58,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:58,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:58,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:58,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:58,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:58,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:58,253 INFO L353 Elim1Store]: treesize reduction 106, result has 0.9 percent of original size [2022-01-31 11:50:58,253 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 84 treesize of output 90 [2022-01-31 11:50:59,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:59,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:59,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:59,113 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:50:59,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:59,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:59,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:59,117 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:50:59,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:59,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:59,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:59,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:59,122 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:50:59,124 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 72 [2022-01-31 11:50:59,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:59,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:59,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:59,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:59,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:59,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:59,606 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 69 [2022-01-31 11:50:59,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:59,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:59,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:59,898 INFO L353 Elim1Store]: treesize reduction 76, result has 43.3 percent of original size [2022-01-31 11:50:59,898 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 88 [2022-01-31 11:51:00,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:00,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:00,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:00,676 INFO L353 Elim1Store]: treesize reduction 76, result has 43.3 percent of original size [2022-01-31 11:51:00,677 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 105 [2022-01-31 11:51:02,029 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-01-31 11:51:02,350 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:51:02,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:51:07,385 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 Int) (v_main_~i~0_157 Int) (main_~i~0 Int) (v_ArrVal_513 Int)) (or (< (+ v_main_~i~0_157 1) c_~N~0) (not (<= v_main_~i~0_157 (+ main_~i~0 1))) (not (< v_main_~i~0_157 c_~N~0)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 8)) v_ArrVal_511) (+ c_main_~a~0.offset (* 8 v_main_~i~0_157)) v_ArrVal_513) c_main_~a~0.offset) (+ c_~N~0 1)))) is different from false [2022-01-31 11:55:26,095 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_157 Int) (v_main_~i~0_159 Int)) (or (let ((.cse0 (<= (+ c_main_~i~0 3) v_main_~i~0_157)) (.cse1 (<= v_main_~i~0_157 (+ c_main_~i~0 1))) (.cse2 (<= v_main_~i~0_157 0))) (and (or .cse0 .cse1 .cse2 (forall ((v_ArrVal_511 Int) (v_main_~i~0_165 Int) (v_ArrVal_509 Int) (v_ArrVal_513 Int)) (or (<= (+ 2 v_main_~i~0_165) v_main_~i~0_157) (<= v_main_~i~0_157 v_main_~i~0_165) (<= (+ 2 v_main_~i~0_157) (select (store (store (let ((.cse12 (+ c_main_~a~0.offset 8))) (store (let ((.cse13 (let ((.cse14 (* c_main_~i~0 8))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse14) 1) (+ c_main_~a~0.offset .cse14 8) 1) (+ c_main_~a~0.offset 16 .cse14) 1)))) (let ((.cse9 (store |c_#memory_int| c_main_~a~0.base .cse13))) (let ((.cse10 (select .cse9 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse10 |c_main_~#sum~0.offset|)) (.cse5 (select .cse13 c_main_~a~0.offset))) (let ((.cse8 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse4 .cse5))) c_main_~a~0.base) .cse12)) (.cse11 (* 8 v_main_~i~0_165))) (let ((.cse7 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse8))) c_main_~a~0.base) (+ c_main_~a~0.offset .cse11)))) (let ((.cse6 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse7 .cse8))) c_main_~a~0.base) (+ c_main_~a~0.offset .cse11 8)))) (let ((.cse3 (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse6 .cse7 .cse8))) c_main_~a~0.base))) (store .cse3 c_main_~a~0.offset (+ .cse4 .cse5 .cse6 (select .cse3 c_main_~a~0.offset) .cse7 .cse8)))))))))) .cse12 v_ArrVal_509)) (+ (* 8 v_main_~i~0_159) c_main_~a~0.offset) v_ArrVal_511) (+ c_main_~a~0.offset (* 8 v_main_~i~0_157)) v_ArrVal_513) c_main_~a~0.offset))))) (or .cse0 .cse1 (forall ((v_ArrVal_511 Int) (v_main_~i~0_165 Int) (v_ArrVal_509 Int) (v_ArrVal_513 Int)) (or (<= (+ 2 v_main_~i~0_165) v_main_~i~0_157) (<= (select (store (store (let ((.cse24 (+ c_main_~a~0.offset 8))) (store (let ((.cse25 (let ((.cse26 (* c_main_~i~0 8))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse26) 1) (+ c_main_~a~0.offset .cse26 8) 1) (+ c_main_~a~0.offset 16 .cse26) 1)))) (let ((.cse21 (store |c_#memory_int| c_main_~a~0.base .cse25))) (let ((.cse22 (select .cse21 |c_main_~#sum~0.base|))) (let ((.cse16 (select .cse22 |c_main_~#sum~0.offset|)) (.cse17 (select .cse25 c_main_~a~0.offset))) (let ((.cse20 (select (select (store .cse21 |c_main_~#sum~0.base| (store .cse22 |c_main_~#sum~0.offset| (+ .cse16 .cse17))) c_main_~a~0.base) .cse24)) (.cse23 (* 8 v_main_~i~0_165))) (let ((.cse19 (select (select (store .cse21 |c_main_~#sum~0.base| (store .cse22 |c_main_~#sum~0.offset| (+ .cse16 .cse17 .cse20))) c_main_~a~0.base) (+ c_main_~a~0.offset .cse23)))) (let ((.cse18 (select (select (store .cse21 |c_main_~#sum~0.base| (store .cse22 |c_main_~#sum~0.offset| (+ .cse16 .cse17 .cse19 .cse20))) c_main_~a~0.base) (+ c_main_~a~0.offset .cse23 8)))) (let ((.cse15 (select (store .cse21 |c_main_~#sum~0.base| (store .cse22 |c_main_~#sum~0.offset| (+ .cse16 .cse17 .cse18 .cse19 .cse20))) c_main_~a~0.base))) (store .cse15 c_main_~a~0.offset (+ .cse16 .cse17 .cse18 (select .cse15 c_main_~a~0.offset) .cse19 .cse20)))))))))) .cse24 v_ArrVal_509)) (+ (* 8 v_main_~i~0_159) c_main_~a~0.offset) v_ArrVal_511) (+ c_main_~a~0.offset (* 8 v_main_~i~0_157)) v_ArrVal_513) c_main_~a~0.offset) (+ 2 v_main_~i~0_157)) (<= v_main_~i~0_157 v_main_~i~0_165))) .cse2))) (not (<= v_main_~i~0_157 (+ v_main_~i~0_159 1))))) is different from false [2022-01-31 11:55:28,774 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_157 Int) (v_main_~i~0_159 Int)) (or (let ((.cse0 (<= v_main_~i~0_157 (+ c_main_~i~0 2))) (.cse1 (<= (+ c_main_~i~0 4) v_main_~i~0_157)) (.cse2 (<= v_main_~i~0_157 0))) (and (or .cse0 .cse1 .cse2 (forall ((v_ArrVal_511 Int) (v_main_~i~0_165 Int) (v_ArrVal_509 Int) (v_ArrVal_513 Int)) (or (<= (+ 2 v_main_~i~0_165) v_main_~i~0_157) (<= v_main_~i~0_157 v_main_~i~0_165) (<= (+ 2 v_main_~i~0_157) (select (store (store (let ((.cse12 (+ c_main_~a~0.offset 8))) (store (let ((.cse13 (let ((.cse14 (* c_main_~i~0 8))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse14 8) 1) (+ c_main_~a~0.offset 16 .cse14) 1) (+ c_main_~a~0.offset .cse14 24) 1)))) (let ((.cse9 (store |c_#memory_int| c_main_~a~0.base .cse13))) (let ((.cse10 (select .cse9 |c_main_~#sum~0.base|))) (let ((.cse5 (select .cse10 |c_main_~#sum~0.offset|)) (.cse8 (select .cse13 c_main_~a~0.offset))) (let ((.cse4 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse5 .cse8))) c_main_~a~0.base) .cse12)) (.cse11 (* 8 v_main_~i~0_165))) (let ((.cse7 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse8))) c_main_~a~0.base) (+ c_main_~a~0.offset .cse11)))) (let ((.cse6 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse7 .cse8))) c_main_~a~0.base) (+ c_main_~a~0.offset .cse11 8)))) (let ((.cse3 (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse6 .cse7 .cse8))) c_main_~a~0.base))) (store .cse3 c_main_~a~0.offset (+ .cse4 .cse5 (select .cse3 c_main_~a~0.offset) .cse6 .cse7 .cse8)))))))))) .cse12 v_ArrVal_509)) (+ (* 8 v_main_~i~0_159) c_main_~a~0.offset) v_ArrVal_511) (+ c_main_~a~0.offset (* 8 v_main_~i~0_157)) v_ArrVal_513) c_main_~a~0.offset))))) (or .cse0 (forall ((v_ArrVal_511 Int) (v_main_~i~0_165 Int) (v_ArrVal_509 Int) (v_ArrVal_513 Int)) (or (<= (+ 2 v_main_~i~0_165) v_main_~i~0_157) (<= (select (store (store (let ((.cse24 (+ c_main_~a~0.offset 8))) (store (let ((.cse25 (let ((.cse26 (* c_main_~i~0 8))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse26 8) 1) (+ c_main_~a~0.offset 16 .cse26) 1) (+ c_main_~a~0.offset .cse26 24) 1)))) (let ((.cse21 (store |c_#memory_int| c_main_~a~0.base .cse25))) (let ((.cse22 (select .cse21 |c_main_~#sum~0.base|))) (let ((.cse17 (select .cse22 |c_main_~#sum~0.offset|)) (.cse20 (select .cse25 c_main_~a~0.offset))) (let ((.cse16 (select (select (store .cse21 |c_main_~#sum~0.base| (store .cse22 |c_main_~#sum~0.offset| (+ .cse17 .cse20))) c_main_~a~0.base) .cse24)) (.cse23 (* 8 v_main_~i~0_165))) (let ((.cse19 (select (select (store .cse21 |c_main_~#sum~0.base| (store .cse22 |c_main_~#sum~0.offset| (+ .cse16 .cse17 .cse20))) c_main_~a~0.base) (+ c_main_~a~0.offset .cse23)))) (let ((.cse18 (select (select (store .cse21 |c_main_~#sum~0.base| (store .cse22 |c_main_~#sum~0.offset| (+ .cse16 .cse17 .cse19 .cse20))) c_main_~a~0.base) (+ c_main_~a~0.offset .cse23 8)))) (let ((.cse15 (select (store .cse21 |c_main_~#sum~0.base| (store .cse22 |c_main_~#sum~0.offset| (+ .cse16 .cse17 .cse18 .cse19 .cse20))) c_main_~a~0.base))) (store .cse15 c_main_~a~0.offset (+ .cse16 .cse17 (select .cse15 c_main_~a~0.offset) .cse18 .cse19 .cse20)))))))))) .cse24 v_ArrVal_509)) (+ (* 8 v_main_~i~0_159) c_main_~a~0.offset) v_ArrVal_511) (+ c_main_~a~0.offset (* 8 v_main_~i~0_157)) v_ArrVal_513) c_main_~a~0.offset) (+ 2 v_main_~i~0_157)) (<= v_main_~i~0_157 v_main_~i~0_165))) .cse1 .cse2))) (not (<= v_main_~i~0_157 (+ v_main_~i~0_159 1))))) is different from false [2022-01-31 11:55:31,633 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_157 Int) (v_main_~i~0_159 Int)) (or (let ((.cse0 (<= v_main_~i~0_157 (+ c_main_~i~0 2))) (.cse1 (<= (+ c_main_~i~0 4) v_main_~i~0_157)) (.cse2 (<= v_main_~i~0_157 0))) (and (or .cse0 .cse1 .cse2 (forall ((v_ArrVal_511 Int) (v_main_~i~0_165 Int) (v_ArrVal_509 Int) (v_ArrVal_513 Int)) (or (<= (+ 2 v_main_~i~0_165) v_main_~i~0_157) (<= (select (store (store (let ((.cse12 (+ c_main_~a~0.offset 8))) (store (let ((.cse13 (let ((.cse14 (* c_main_~i~0 8))) (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse14) 1) (+ c_main_~a~0.offset .cse14 8) 1) (+ c_main_~a~0.offset 16 .cse14) 1) (+ c_main_~a~0.offset .cse14 24) 1)))) (let ((.cse9 (store |c_#memory_int| c_main_~a~0.base .cse13))) (let ((.cse10 (select .cse9 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse10 |c_main_~#sum~0.offset|)) (.cse6 (select .cse13 c_main_~a~0.offset))) (let ((.cse8 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse4 .cse6))) c_main_~a~0.base) .cse12)) (.cse11 (* 8 v_main_~i~0_165))) (let ((.cse7 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse4 .cse6 .cse8))) c_main_~a~0.base) (+ c_main_~a~0.offset .cse11)))) (let ((.cse5 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse4 .cse6 .cse7 .cse8))) c_main_~a~0.base) (+ c_main_~a~0.offset .cse11 8)))) (let ((.cse3 (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse6 .cse7 .cse8))) c_main_~a~0.base))) (store .cse3 c_main_~a~0.offset (+ .cse4 .cse5 .cse6 (select .cse3 c_main_~a~0.offset) .cse7 .cse8)))))))))) .cse12 v_ArrVal_509)) (+ (* 8 v_main_~i~0_159) c_main_~a~0.offset) v_ArrVal_511) (+ c_main_~a~0.offset (* 8 v_main_~i~0_157)) v_ArrVal_513) c_main_~a~0.offset) (+ 2 v_main_~i~0_157)) (<= v_main_~i~0_157 v_main_~i~0_165)))) (or .cse0 (forall ((v_ArrVal_511 Int) (v_main_~i~0_165 Int) (v_ArrVal_509 Int) (v_ArrVal_513 Int)) (or (<= (+ 2 v_main_~i~0_165) v_main_~i~0_157) (<= v_main_~i~0_157 v_main_~i~0_165) (<= (+ 2 v_main_~i~0_157) (select (store (store (let ((.cse24 (+ c_main_~a~0.offset 8))) (store (let ((.cse25 (let ((.cse26 (* c_main_~i~0 8))) (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse26) 1) (+ c_main_~a~0.offset .cse26 8) 1) (+ c_main_~a~0.offset 16 .cse26) 1) (+ c_main_~a~0.offset .cse26 24) 1)))) (let ((.cse21 (store |c_#memory_int| c_main_~a~0.base .cse25))) (let ((.cse22 (select .cse21 |c_main_~#sum~0.base|))) (let ((.cse16 (select .cse22 |c_main_~#sum~0.offset|)) (.cse18 (select .cse25 c_main_~a~0.offset))) (let ((.cse20 (select (select (store .cse21 |c_main_~#sum~0.base| (store .cse22 |c_main_~#sum~0.offset| (+ .cse16 .cse18))) c_main_~a~0.base) .cse24)) (.cse23 (* 8 v_main_~i~0_165))) (let ((.cse19 (select (select (store .cse21 |c_main_~#sum~0.base| (store .cse22 |c_main_~#sum~0.offset| (+ .cse16 .cse18 .cse20))) c_main_~a~0.base) (+ c_main_~a~0.offset .cse23)))) (let ((.cse17 (select (select (store .cse21 |c_main_~#sum~0.base| (store .cse22 |c_main_~#sum~0.offset| (+ .cse16 .cse18 .cse19 .cse20))) c_main_~a~0.base) (+ c_main_~a~0.offset .cse23 8)))) (let ((.cse15 (select (store .cse21 |c_main_~#sum~0.base| (store .cse22 |c_main_~#sum~0.offset| (+ .cse16 .cse17 .cse18 .cse19 .cse20))) c_main_~a~0.base))) (store .cse15 c_main_~a~0.offset (+ .cse16 .cse17 .cse18 (select .cse15 c_main_~a~0.offset) .cse19 .cse20)))))))))) .cse24 v_ArrVal_509)) (+ (* 8 v_main_~i~0_159) c_main_~a~0.offset) v_ArrVal_511) (+ c_main_~a~0.offset (* 8 v_main_~i~0_157)) v_ArrVal_513) c_main_~a~0.offset)))) .cse1 .cse2))) (not (<= v_main_~i~0_157 (+ v_main_~i~0_159 1))))) is different from false [2022-01-31 11:55:31,687 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2022-01-31 11:55:31,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93162320] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:55:31,688 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:55:31,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34, 34] total 85 [2022-01-31 11:55:31,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378315305] [2022-01-31 11:55:31,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:55:31,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-01-31 11:55:31,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:55:31,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-01-31 11:55:31,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=5841, Unknown=84, NotChecked=644, Total=7140 [2022-01-31 11:55:31,690 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 85 states, 83 states have (on average 1.216867469879518) internal successors, (101), 82 states have internal predecessors, (101), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:55:39,088 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (= (select .cse0 (+ c_main_~a~0.offset (* c_~N~0 8) (- 8))) 1) (<= c_main_~i~0 1) (forall ((v_ArrVal_511 Int) (v_main_~i~0_157 Int) (main_~i~0 Int) (v_ArrVal_513 Int)) (or (< (+ v_main_~i~0_157 1) c_~N~0) (not (<= v_main_~i~0_157 (+ main_~i~0 1))) (not (< v_main_~i~0_157 c_~N~0)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 8)) v_ArrVal_511) (+ c_main_~a~0.offset (* 8 v_main_~i~0_157)) v_ArrVal_513) c_main_~a~0.offset) (+ c_~N~0 1)))) (<= 1 c_main_~i~0) (<= c_~N~0 4) (exists ((v_main_~i~0_151 Int)) (and (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_151) (- 8))) 1) (< v_main_~i~0_151 c_~N~0) (<= c_~N~0 (+ v_main_~i~0_151 1)))) (exists ((v_main_~i~0_151 Int)) (and (< v_main_~i~0_151 c_~N~0) (<= c_~N~0 (+ v_main_~i~0_151 1)) (let ((.cse7 (* 8 v_main_~i~0_151)) (.cse2 (* c_~N~0 8)) (.cse4 (* c_main_~i~0 8)) (.cse8 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse3 (= (select .cse8 c_main_~a~0.offset) 5)) (.cse1 (+ .cse4 8)) (.cse5 (= (select .cse8 (+ c_main_~a~0.offset .cse2 (- 8))) 1)) (.cse6 (= (select .cse8 (+ c_main_~a~0.offset .cse7 (- 8))) 1))) (or (and (= .cse1 .cse2) .cse3) (and (or (= .cse4 0) .cse3) (or .cse5 .cse6 (= .cse7 .cse1))) (and .cse5 (<= c_main_~i~0 1) .cse6)))))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (< c_main_~i~0 c_~N~0) (= (select .cse0 0) (+ c_~N~0 1)) (= c_main_~a~0.offset 0) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (and (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4))) (= (select .cse0 c_main_~a~0.offset) 5) (<= 4 c_~N~0))) is different from false [2022-01-31 11:55:40,712 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (= (select .cse0 (+ c_main_~a~0.offset (* c_~N~0 8) (- 8))) 1) (forall ((v_ArrVal_511 Int) (v_main_~i~0_157 Int) (main_~i~0 Int) (v_ArrVal_513 Int)) (or (< (+ v_main_~i~0_157 1) c_~N~0) (not (<= v_main_~i~0_157 (+ main_~i~0 1))) (not (< v_main_~i~0_157 c_~N~0)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 8)) v_ArrVal_511) (+ c_main_~a~0.offset (* 8 v_main_~i~0_157)) v_ArrVal_513) c_main_~a~0.offset) (+ c_~N~0 1)))) (<= c_~N~0 4) (exists ((v_main_~i~0_151 Int)) (and (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_151) (- 8))) 1) (< v_main_~i~0_151 c_~N~0) (<= c_~N~0 (+ v_main_~i~0_151 1)))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select .cse0 0) (+ c_~N~0 1)) (= c_main_~a~0.offset 0) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (and (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4))) (= (select .cse0 c_main_~a~0.offset) 5) (exists ((v_main_~i~0_151 Int)) (and (let ((.cse4 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse1 (= (select .cse4 (+ c_main_~a~0.offset (* c_~N~0 8) (- 8))) 1)) (.cse3 (<= c_main_~i~0 1)) (.cse2 (= (select .cse4 (+ c_main_~a~0.offset (* 8 v_main_~i~0_151) (- 8))) 1))) (or (and .cse1 .cse2 (<= c_main_~i~0 2)) (and .cse1 .cse3) (and .cse3 .cse2) (and (<= c_main_~i~0 c_~N~0) (= (select .cse4 c_main_~a~0.offset) 5))))) (< v_main_~i~0_151 c_~N~0) (<= c_~N~0 (+ v_main_~i~0_151 1)))) (<= 4 c_~N~0) (<= (+ 2 (div (* (- 1) c_main_~a~0.offset) 8)) c_main_~i~0))) is different from false [2022-01-31 11:55:42,358 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_main_~i~0 8)) (.cse2 (select |c_#memory_int| c_main_~a~0.base))) (and (forall ((v_ArrVal_511 Int) (v_main_~i~0_157 Int) (main_~i~0 Int) (v_ArrVal_513 Int)) (or (< (+ v_main_~i~0_157 1) c_~N~0) (not (<= v_main_~i~0_157 (+ main_~i~0 1))) (not (< v_main_~i~0_157 c_~N~0)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 8)) v_ArrVal_511) (+ c_main_~a~0.offset (* 8 v_main_~i~0_157)) v_ArrVal_513) c_main_~a~0.offset) (+ c_~N~0 1)))) (<= c_~N~0 4) (exists ((v_main_~i~0_151 Int)) (and (< v_main_~i~0_151 c_~N~0) (let ((.cse0 (* 8 v_main_~i~0_151))) (or (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse0 (- 8))) 1) (= .cse0 (+ (* c_main_~i~0 8) 8)))) (<= c_~N~0 (+ v_main_~i~0_151 1)))) (or (= .cse1 0) (= (select .cse2 c_main_~a~0.offset) 5)) (exists ((v_main_~i~0_151 Int)) (and (< v_main_~i~0_151 c_~N~0) (<= c_~N~0 (+ v_main_~i~0_151 1)) (let ((.cse9 (* 8 v_main_~i~0_151)) (.cse4 (* c_~N~0 8)) (.cse6 (* c_main_~i~0 8)) (.cse10 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse5 (= (select .cse10 c_main_~a~0.offset) 5)) (.cse3 (+ .cse6 8)) (.cse7 (= (select .cse10 (+ c_main_~a~0.offset .cse4 (- 8))) 1)) (.cse8 (= (select .cse10 (+ c_main_~a~0.offset .cse9 (- 8))) 1))) (or (and (= .cse3 .cse4) .cse5) (and (or (= .cse6 0) .cse5) (or .cse7 .cse8 (= .cse9 .cse3))) (and .cse7 (<= c_main_~i~0 1) .cse8)))))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (< c_main_~i~0 c_~N~0) (let ((.cse11 (* c_~N~0 8))) (or (= (select .cse2 (+ c_main_~a~0.offset .cse11 (- 8))) 1) (= (+ .cse1 8) .cse11))) (= (select .cse2 0) (+ c_~N~0 1)) (= c_main_~a~0.offset 0) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (and (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4))) (<= 4 c_~N~0) (<= (+ 2 (div (* (- 1) c_main_~a~0.offset) 8)) c_main_~i~0))) is different from false [2022-01-31 11:55:44,310 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_511 Int) (v_main_~i~0_157 Int) (main_~i~0 Int) (v_ArrVal_513 Int)) (or (< (+ v_main_~i~0_157 1) c_~N~0) (not (<= v_main_~i~0_157 (+ main_~i~0 1))) (not (< v_main_~i~0_157 c_~N~0)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 8)) v_ArrVal_511) (+ c_main_~a~0.offset (* 8 v_main_~i~0_157)) v_ArrVal_513) c_main_~a~0.offset) (+ c_~N~0 1)))) (<= c_~N~0 4) (not (= (+ c_main_~a~0.offset (* c_main_~i~0 8)) 0)) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select (select |c_#memory_int| c_main_~a~0.base) 0) (+ c_~N~0 1)) (= c_main_~a~0.offset 0) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (and (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4))) (exists ((v_main_~i~0_151 Int)) (and (let ((.cse2 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse0 (= (select .cse2 (+ c_main_~a~0.offset (* c_~N~0 8) (- 8))) 1)) (.cse1 (= (select .cse2 (+ c_main_~a~0.offset (* 8 v_main_~i~0_151) (- 8))) 1))) (or (and (or (and .cse0 (<= c_main_~i~0 v_main_~i~0_151)) (and .cse1 (or .cse0 (<= c_main_~i~0 c_~N~0)))) (= (select .cse2 c_main_~a~0.offset) 5)) (and .cse0 (<= c_main_~i~0 1) .cse1)))) (< v_main_~i~0_151 c_~N~0) (<= c_~N~0 (+ v_main_~i~0_151 1)))) (exists ((v_main_~i~0_151 Int)) (and (let ((.cse6 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse3 (= (select .cse6 (+ c_main_~a~0.offset (* c_~N~0 8) (- 8))) 1)) (.cse5 (<= c_main_~i~0 1)) (.cse4 (= (select .cse6 (+ c_main_~a~0.offset (* 8 v_main_~i~0_151) (- 8))) 1))) (or (and .cse3 .cse4 (<= c_main_~i~0 2)) (and .cse3 .cse5) (and .cse5 .cse4) (and (<= c_main_~i~0 c_~N~0) (= (select .cse6 c_main_~a~0.offset) 5))))) (< v_main_~i~0_151 c_~N~0) (<= c_~N~0 (+ v_main_~i~0_151 1)))) (<= 4 c_~N~0)) is different from false [2022-01-31 11:55:46,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:55:46,230 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2022-01-31 11:55:46,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-31 11:55:46,230 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 83 states have (on average 1.216867469879518) internal successors, (101), 82 states have internal predecessors, (101), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-01-31 11:55:46,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:55:46,232 INFO L225 Difference]: With dead ends: 127 [2022-01-31 11:55:46,232 INFO L226 Difference]: Without dead ends: 127 [2022-01-31 11:55:46,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 44 SyntacticMatches, 9 SemanticMatches, 105 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 2937 ImplicationChecksByTransitivity, 281.2s TimeCoverageRelationStatistics Valid=831, Invalid=8814, Unknown=89, NotChecked=1608, Total=11342 [2022-01-31 11:55:46,234 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 39 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 2417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1579 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:55:46,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 376 Invalid, 2417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 794 Invalid, 0 Unknown, 1579 Unchecked, 1.1s Time] [2022-01-31 11:55:46,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-01-31 11:55:46,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2022-01-31 11:55:46,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 104 states have (on average 1.0961538461538463) internal successors, (114), 106 states have internal predecessors, (114), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 11:55:46,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2022-01-31 11:55:46,238 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 48 [2022-01-31 11:55:46,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:55:46,239 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2022-01-31 11:55:46,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 83 states have (on average 1.216867469879518) internal successors, (101), 82 states have internal predecessors, (101), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:55:46,239 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2022-01-31 11:55:46,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 11:55:46,240 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:55:46,240 INFO L514 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2022-01-31 11:55:46,263 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 11:55:46,440 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 11:55:46,440 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:55:46,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:55:46,441 INFO L85 PathProgramCache]: Analyzing trace with hash -396116420, now seen corresponding path program 2 times [2022-01-31 11:55:46,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:55:46,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149611853] [2022-01-31 11:55:46,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:55:46,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:55:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:55:49,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:55:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:55:49,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:55:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:55:49,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 11:55:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:55:49,808 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:55:49,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:55:49,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149611853] [2022-01-31 11:55:49,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149611853] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:55:49,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603420359] [2022-01-31 11:55:49,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:55:49,809 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:55:49,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:55:49,810 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 11:55:49,811 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 11:55:49,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:55:49,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:55:49,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 60 conjunts are in the unsatisfiable core [2022-01-31 11:55:49,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:55:49,896 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 11:55:49,978 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 11:55:50,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:55:50,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:55:50,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:55:50,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:55:50,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:55:50,381 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-01-31 11:55:50,529 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-31 11:55:50,571 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-31 11:55:50,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:55:50,612 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-01-31 11:55:50,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:55:50,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:55:50,784 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2022-01-31 11:55:51,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:55:51,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:55:51,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:55:51,065 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2022-01-31 11:55:51,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:55:51,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:55:51,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:55:51,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2022-01-31 11:55:58,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2022-01-31 11:55:58,906 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 11:55:58,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:56:29,770 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_581 Int) (v_main_~i~0_181 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_181)) (let ((.cse0 (store (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse2 (+ c_main_~a~0.offset (* c_main_~i~0 8)))) (store .cse1 .cse2 (+ (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse1 .cse2)))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_181)) v_ArrVal_581))) (= (select .cse0 (+ c_main_~a~0.offset 8)) (select .cse0 c_main_~a~0.offset))))) is different from false [2022-01-31 11:56:31,553 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_581 Int) (v_main_~i~0_181 Int)) (or (let ((.cse0 (store (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse2 (+ c_main_~a~0.offset (* c_main_~i~0 8) 8))) (store .cse1 .cse2 (+ (select .cse1 .cse2) (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_181)) v_ArrVal_581))) (= (select .cse0 (+ c_main_~a~0.offset 8)) (select .cse0 c_main_~a~0.offset))) (not (<= (+ c_main_~i~0 2) v_main_~i~0_181)))) is different from false [2022-01-31 11:58:17,808 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_576 Int) (v_ArrVal_581 Int) (v_main_~i~0_181 Int)) (or (not (<= 2 v_main_~i~0_181)) (let ((.cse1 (+ c_main_~a~0.offset 8))) (let ((.cse0 (store (let ((.cse3 (store |c_#memory_int| |c_main_~#sum~0.base| (store (select |c_#memory_int| |c_main_~#sum~0.base|) |main_~#sum~0.offset| v_ArrVal_576)))) (let ((.cse2 (let ((.cse4 (select .cse3 c_main_~a~0.base))) (store .cse4 c_main_~a~0.offset (+ v_ArrVal_576 (select .cse4 c_main_~a~0.offset)))))) (store .cse2 .cse1 (+ (select .cse2 .cse1) (select (select (store .cse3 c_main_~a~0.base .cse2) |c_main_~#sum~0.base|) |main_~#sum~0.offset|))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_181)) v_ArrVal_581))) (= (select .cse0 c_main_~a~0.offset) (select .cse0 .cse1)))))) is different from false [2022-01-31 11:58:17,838 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:58:17,838 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 209 treesize of output 174 [2022-01-31 11:58:17,859 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_~#sum~0.offset| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_581 Int) (v_main_~i~0_181 Int)) (or (let ((.cse1 (+ c_main_~a~0.offset 8))) (let ((.cse0 (store (let ((.cse3 (store |c_#memory_int| |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse2 (let ((.cse4 (select .cse3 c_main_~a~0.base))) (store .cse4 c_main_~a~0.offset (+ (select .cse4 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (store .cse2 .cse1 (+ (select .cse2 .cse1) (select (select (store .cse3 c_main_~a~0.base .cse2) |c_main_~#sum~0.base|) |main_~#sum~0.offset|))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_181)) v_ArrVal_581))) (= (select .cse0 c_main_~a~0.offset) (select .cse0 .cse1)))) (not (<= 2 v_main_~i~0_181)))) is different from false [2022-01-31 11:58:17,961 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_~#sum~0.offset| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_571 Int) (v_ArrVal_581 Int) (v_main_~i~0_181 Int)) (or (let ((.cse1 (+ c_main_~a~0.offset 8))) (let ((.cse0 (store (let ((.cse3 (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8)) v_ArrVal_571)) |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse2 (let ((.cse4 (select .cse3 c_main_~a~0.base))) (store .cse4 c_main_~a~0.offset (+ (select .cse4 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (store .cse2 .cse1 (+ (select (select (store .cse3 c_main_~a~0.base .cse2) |c_main_~#sum~0.base|) |main_~#sum~0.offset|) (select .cse2 .cse1))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_181)) v_ArrVal_581))) (= (select .cse0 c_main_~a~0.offset) (select .cse0 .cse1)))) (not (<= 2 v_main_~i~0_181)))) is different from false [2022-01-31 11:58:18,032 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_189 Int)) (or (forall ((|main_~#sum~0.offset| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_571 Int) (v_ArrVal_581 Int) (v_main_~i~0_181 Int)) (or (let ((.cse1 (+ c_main_~a~0.offset 8))) (let ((.cse0 (store (let ((.cse3 (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_189)) v_ArrVal_571)) |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse2 (let ((.cse4 (select .cse3 c_main_~a~0.base))) (store .cse4 c_main_~a~0.offset (+ (select .cse4 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (store .cse2 .cse1 (+ (select .cse2 .cse1) (select (select (store .cse3 c_main_~a~0.base .cse2) |c_main_~#sum~0.base|) |main_~#sum~0.offset|))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_181)) v_ArrVal_581))) (= (select .cse0 .cse1) (select .cse0 c_main_~a~0.offset)))) (not (<= 2 v_main_~i~0_181)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_189)))) is different from false [2022-01-31 11:58:18,093 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_~#sum~0.offset| Int) (v_main_~i~0_189 Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_571 Int) (v_ArrVal_581 Int) (v_main_~i~0_181 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_189)) (let ((.cse1 (+ c_main_~a~0.offset 8))) (let ((.cse0 (store (let ((.cse3 (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8)) 1) (+ c_main_~a~0.offset (* 8 v_main_~i~0_189)) v_ArrVal_571)) |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse2 (let ((.cse4 (select .cse3 c_main_~a~0.base))) (store .cse4 c_main_~a~0.offset (+ (select .cse4 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (store .cse2 .cse1 (+ (select (select (store .cse3 c_main_~a~0.base .cse2) |c_main_~#sum~0.base|) |main_~#sum~0.offset|) (select .cse2 .cse1))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_181)) v_ArrVal_581))) (= (select .cse0 .cse1) (select .cse0 c_main_~a~0.offset)))) (not (<= 2 v_main_~i~0_181)))) is different from false [2022-01-31 11:58:18,154 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_~#sum~0.offset| Int) (v_main_~i~0_189 Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_571 Int) (v_ArrVal_581 Int) (v_main_~i~0_181 Int)) (or (not (<= (+ c_main_~i~0 2) v_main_~i~0_189)) (let ((.cse1 (+ c_main_~a~0.offset 8))) (let ((.cse0 (store (let ((.cse3 (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8) 8) 1) (+ c_main_~a~0.offset (* 8 v_main_~i~0_189)) v_ArrVal_571)) |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse2 (let ((.cse4 (select .cse3 c_main_~a~0.base))) (store .cse4 c_main_~a~0.offset (+ (select .cse4 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (store .cse2 .cse1 (+ (select .cse2 .cse1) (select (select (store .cse3 c_main_~a~0.base .cse2) |c_main_~#sum~0.base|) |main_~#sum~0.offset|))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_181)) v_ArrVal_581))) (= (select .cse0 c_main_~a~0.offset) (select .cse0 .cse1)))) (not (<= 2 v_main_~i~0_181)))) is different from false [2022-01-31 11:58:18,223 INFO L353 Elim1Store]: treesize reduction 127, result has 23.0 percent of original size [2022-01-31 11:58:18,224 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 557 treesize of output 217 [2022-01-31 11:58:18,230 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 471 treesize of output 427 [2022-01-31 11:58:18,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:58:18,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:58:18,235 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:58:18,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:58:18,397 INFO L353 Elim1Store]: treesize reduction 29, result has 74.8 percent of original size [2022-01-31 11:58:18,397 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 101 treesize of output 151 [2022-01-31 11:58:18,403 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:58:18,404 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:58:18,405 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:58:18,411 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:58:18,435 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:58:18,436 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 112 [2022-01-31 11:58:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 22 not checked. [2022-01-31 11:58:19,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603420359] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:58:19,181 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:58:19,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 24, 25] total 72 [2022-01-31 11:58:19,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761302020] [2022-01-31 11:58:19,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:58:19,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-01-31 11:58:19,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:58:19,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-01-31 11:58:19,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=3653, Unknown=55, NotChecked=1048, Total=5112 [2022-01-31 11:58:19,183 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand has 72 states, 68 states have (on average 1.5441176470588236) internal successors, (105), 69 states have internal predecessors, (105), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 11:58:19,371 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8))) 1) (forall ((|main_~#sum~0.offset| Int) (v_main_~i~0_189 Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_571 Int) (v_ArrVal_581 Int) (v_main_~i~0_181 Int)) (or (not (<= (+ c_main_~i~0 2) v_main_~i~0_189)) (let ((.cse1 (+ c_main_~a~0.offset 8))) (let ((.cse0 (store (let ((.cse3 (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8) 8) 1) (+ c_main_~a~0.offset (* 8 v_main_~i~0_189)) v_ArrVal_571)) |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse2 (let ((.cse4 (select .cse3 c_main_~a~0.base))) (store .cse4 c_main_~a~0.offset (+ (select .cse4 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (store .cse2 .cse1 (+ (select .cse2 .cse1) (select (select (store .cse3 c_main_~a~0.base .cse2) |c_main_~#sum~0.base|) |main_~#sum~0.offset|))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_181)) v_ArrVal_581))) (= (select .cse0 c_main_~a~0.offset) (select .cse0 .cse1)))) (not (<= 2 v_main_~i~0_181)))) (= c_main_~i~0 0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 0)) is different from false [2022-01-31 11:58:19,378 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_main_~i~0 1) (<= 1 c_main_~i~0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 0) (= (select (select |c_#memory_int| c_main_~a~0.base) 0) 1) (forall ((|main_~#sum~0.offset| Int) (v_main_~i~0_189 Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_571 Int) (v_ArrVal_581 Int) (v_main_~i~0_181 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_189)) (let ((.cse1 (+ c_main_~a~0.offset 8))) (let ((.cse0 (store (let ((.cse3 (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8)) 1) (+ c_main_~a~0.offset (* 8 v_main_~i~0_189)) v_ArrVal_571)) |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse2 (let ((.cse4 (select .cse3 c_main_~a~0.base))) (store .cse4 c_main_~a~0.offset (+ (select .cse4 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (store .cse2 .cse1 (+ (select (select (store .cse3 c_main_~a~0.base .cse2) |c_main_~#sum~0.base|) |main_~#sum~0.offset|) (select .cse2 .cse1))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_181)) v_ArrVal_581))) (= (select .cse0 .cse1) (select .cse0 c_main_~a~0.offset)))) (not (<= 2 v_main_~i~0_181))))) is different from false [2022-01-31 11:58:21,382 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (<= c_main_~i~0 1) (<= 1 c_main_~i~0) (= (select .cse0 (+ c_main_~a~0.offset (* c_main_~i~0 8))) 1) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (forall ((v_main_~i~0_189 Int)) (or (forall ((|main_~#sum~0.offset| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_571 Int) (v_ArrVal_581 Int) (v_main_~i~0_181 Int)) (or (let ((.cse2 (+ c_main_~a~0.offset 8))) (let ((.cse1 (store (let ((.cse4 (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_189)) v_ArrVal_571)) |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse3 (let ((.cse5 (select .cse4 c_main_~a~0.base))) (store .cse5 c_main_~a~0.offset (+ (select .cse5 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (store .cse3 .cse2 (+ (select .cse3 .cse2) (select (select (store .cse4 c_main_~a~0.base .cse3) |c_main_~#sum~0.base|) |main_~#sum~0.offset|))))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_181)) v_ArrVal_581))) (= (select .cse1 .cse2) (select .cse1 c_main_~a~0.offset)))) (not (<= 2 v_main_~i~0_181)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_189)))) (= c_main_~a~0.offset 0) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 0) (= (select .cse0 0) 1))) is different from false [2022-01-31 11:58:47,745 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse9 (select .cse14 0)) (.cse15 (* c_main_~i~0 8))) (let ((.cse4 (select .cse14 (+ c_main_~a~0.offset .cse15))) (.cse10 (<= (+ c_main_~a~0.offset .cse15 9) (* c_~N~0 8))) (.cse2 (not (= |c_main_~#sum~0.base| c_main_~a~0.base))) (.cse3 (<= 3 c_~N~0)) (.cse5 (= (select .cse14 8) 1)) (.cse1 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (.cse6 (<= c_~N~0 3)) (.cse7 (= .cse9 1)) (.cse8 (<= (+ c_main_~i~0 2) (+ c_~N~0 (div (+ (* (- 1) c_main_~a~0.offset) 8) 8))))) (and (or (let ((.cse0 (+ .cse9 1))) (and (<= .cse0 .cse1) .cse2 .cse3 (= (+ (- 1) .cse4) 0) .cse5 .cse6 (<= .cse1 .cse0) .cse7 .cse8)) .cse10) (<= c_main_~i~0 1) (<= 1 c_main_~i~0) (= .cse9 (+ .cse1 .cse4)) (= .cse4 1) (forall ((v_ArrVal_581 Int) (v_main_~i~0_181 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_181)) (let ((.cse11 (store (let ((.cse12 (select |c_#memory_int| c_main_~a~0.base)) (.cse13 (+ c_main_~a~0.offset (* c_main_~i~0 8)))) (store .cse12 .cse13 (+ (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse12 .cse13)))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_181)) v_ArrVal_581))) (= (select .cse11 (+ c_main_~a~0.offset 8)) (select .cse11 c_main_~a~0.offset))))) .cse2 (= .cse9 (+ c_~N~0 1)) (= c_main_~a~0.offset 0) (or .cse10 (and .cse2 .cse3 (<= .cse1 3) .cse5 (<= (+ .cse9 2) .cse1) .cse6 .cse7 .cse8)))))) is different from false [2022-01-31 11:58:50,791 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse5 (select .cse6 0))) (and (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))) (and (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select .cse0 c_main_~a~0.offset) .cse1) (= (select .cse0 (+ c_main_~a~0.offset 8)) .cse1)))) (forall ((v_ArrVal_581 Int) (v_main_~i~0_181 Int)) (or (let ((.cse2 (store (let ((.cse3 (select |c_#memory_int| c_main_~a~0.base)) (.cse4 (+ c_main_~a~0.offset (* c_main_~i~0 8) 8))) (store .cse3 .cse4 (+ (select .cse3 .cse4) (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_181)) v_ArrVal_581))) (= (select .cse2 (+ c_main_~a~0.offset 8)) (select .cse2 c_main_~a~0.offset))) (not (<= (+ c_main_~i~0 2) v_main_~i~0_181)))) (= .cse5 (select .cse6 8)) (= .cse5 (+ c_~N~0 1)) (= c_main_~a~0.offset 0)))) is different from false [2022-01-31 11:58:52,681 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse2 (select .cse3 0))) (and (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))) (and (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select .cse0 c_main_~a~0.offset) .cse1) (= (select .cse0 (+ c_main_~a~0.offset 8)) .cse1)))) (= .cse2 (select .cse3 8)) (forall ((v_ArrVal_581 Int) (v_main_~i~0_181 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_181)) (let ((.cse4 (store (let ((.cse5 (select |c_#memory_int| c_main_~a~0.base)) (.cse6 (+ c_main_~a~0.offset (* c_main_~i~0 8)))) (store .cse5 .cse6 (+ (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse5 .cse6)))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_181)) v_ArrVal_581))) (= (select .cse4 (+ c_main_~a~0.offset 8)) (select .cse4 c_main_~a~0.offset))))) (= .cse2 (+ c_~N~0 1)) (= c_main_~a~0.offset 0)))) is different from false [2022-01-31 11:59:02,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:59:02,072 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2022-01-31 11:59:02,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-01-31 11:59:02,073 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 68 states have (on average 1.5441176470588236) internal successors, (105), 69 states have internal predecessors, (105), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 50 [2022-01-31 11:59:02,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:59:02,074 INFO L225 Difference]: With dead ends: 123 [2022-01-31 11:59:02,074 INFO L226 Difference]: Without dead ends: 121 [2022-01-31 11:59:02,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 66 SyntacticMatches, 7 SemanticMatches, 94 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 1780 ImplicationChecksByTransitivity, 190.9s TimeCoverageRelationStatistics Valid=576, Invalid=6045, Unknown=77, NotChecked=2422, Total=9120 [2022-01-31 11:59:02,076 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 36 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 427 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 11:59:02,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 382 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 614 Invalid, 0 Unknown, 427 Unchecked, 0.7s Time] [2022-01-31 11:59:02,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-01-31 11:59:02,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-01-31 11:59:02,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 106 states have (on average 1.0849056603773586) internal successors, (115), 107 states have internal predecessors, (115), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 11:59:02,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2022-01-31 11:59:02,079 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 50 [2022-01-31 11:59:02,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:59:02,079 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2022-01-31 11:59:02,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 68 states have (on average 1.5441176470588236) internal successors, (105), 69 states have internal predecessors, (105), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 11:59:02,080 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2022-01-31 11:59:02,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 11:59:02,085 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:59:02,085 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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 11:59:02,104 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 11:59:02,295 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 11:59:02,295 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:59:02,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:59:02,296 INFO L85 PathProgramCache]: Analyzing trace with hash 466586013, now seen corresponding path program 10 times [2022-01-31 11:59:02,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:59:02,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31586663] [2022-01-31 11:59:02,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:59:02,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:59:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:59:02,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:59:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:59:02,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:59:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:59:02,514 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:59:02,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:59:02,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31586663] [2022-01-31 11:59:02,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31586663] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:59:02,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055772836] [2022-01-31 11:59:02,514 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:59:02,514 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:59:02,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:59:02,516 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 11:59:02,517 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 11:59:02,584 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:59:02,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:59:02,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 11:59:02,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:59:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:59:02,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:59:03,010 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:59:03,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055772836] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:59:03,011 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:59:03,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-01-31 11:59:03,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205244114] [2022-01-31 11:59:03,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:59:03,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 11:59:03,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:59:03,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 11:59:03,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-01-31 11:59:03,012 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 states have internal predecessors, (55), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:59:03,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:59:03,781 INFO L93 Difference]: Finished difference Result 181 states and 195 transitions. [2022-01-31 11:59:03,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 11:59:03,781 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 states have internal predecessors, (55), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-01-31 11:59:03,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:59:03,782 INFO L225 Difference]: With dead ends: 181 [2022-01-31 11:59:03,782 INFO L226 Difference]: Without dead ends: 178 [2022-01-31 11:59:03,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2022-01-31 11:59:03,783 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 240 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 11:59:03,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 97 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 11:59:03,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-01-31 11:59:03,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 152. [2022-01-31 11:59:03,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 132 states have (on average 1.0681818181818181) internal successors, (141), 134 states have internal predecessors, (141), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-01-31 11:59:03,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2022-01-31 11:59:03,788 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 50 [2022-01-31 11:59:03,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:59:03,788 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2022-01-31 11:59:03,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 states have internal predecessors, (55), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:59:03,788 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2022-01-31 11:59:03,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 11:59:03,788 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:59:03,789 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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 11:59:03,805 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 11:59:03,999 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 11:59:04,000 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:59:04,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:59:04,000 INFO L85 PathProgramCache]: Analyzing trace with hash 623220955, now seen corresponding path program 11 times [2022-01-31 11:59:04,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:59:04,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531553340] [2022-01-31 11:59:04,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:59:04,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:59:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:59:04,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:59:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:59:04,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:59:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:59:04,184 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 9 proven. 32 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:59:04,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:59:04,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531553340] [2022-01-31 11:59:04,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531553340] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:59:04,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105060076] [2022-01-31 11:59:04,184 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:59:04,184 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:59:04,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:59:04,200 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 11:59:04,201 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 11:59:04,350 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-01-31 11:59:04,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:59:04,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 11:59:04,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:59:04,583 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:59:04,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:59:04,729 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:59:04,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105060076] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:59:04,730 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:59:04,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-01-31 11:59:04,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369871047] [2022-01-31 11:59:04,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:59:04,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 11:59:04,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:59:04,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 11:59:04,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-01-31 11:59:04,734 INFO L87 Difference]: Start difference. First operand 152 states and 162 transitions. Second operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 states have internal predecessors, (55), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:59:05,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:59:05,904 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2022-01-31 11:59:05,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 11:59:05,905 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 states have internal predecessors, (55), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-01-31 11:59:05,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:59:05,905 INFO L225 Difference]: With dead ends: 163 [2022-01-31 11:59:05,905 INFO L226 Difference]: Without dead ends: 163 [2022-01-31 11:59:05,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=212, Invalid=780, Unknown=0, NotChecked=0, Total=992 [2022-01-31 11:59:05,906 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 99 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 11:59:05,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 180 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 11:59:05,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-01-31 11:59:05,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 139. [2022-01-31 11:59:05,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 120 states have (on average 1.0583333333333333) internal successors, (127), 121 states have internal predecessors, (127), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-31 11:59:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 146 transitions. [2022-01-31 11:59:05,910 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 146 transitions. Word has length 50 [2022-01-31 11:59:05,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:59:05,910 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 146 transitions. [2022-01-31 11:59:05,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 states have internal predecessors, (55), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:59:05,910 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 146 transitions. [2022-01-31 11:59:05,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 11:59:05,911 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:59:05,911 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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 11:59:05,934 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 11:59:06,111 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 11:59:06,111 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:59:06,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:59:06,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1974105911, now seen corresponding path program 12 times [2022-01-31 11:59:06,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:59:06,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627904434] [2022-01-31 11:59:06,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:59:06,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:59:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:59:09,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:59:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:59:09,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:59:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:59:09,661 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:59:09,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:59:09,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627904434] [2022-01-31 11:59:09,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627904434] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:59:09,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4264716] [2022-01-31 11:59:09,661 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:59:09,662 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:59:09,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:59:09,663 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 11:59:09,663 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 11:59:09,834 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-01-31 11:59:09,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:59:09,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 104 conjunts are in the unsatisfiable core [2022-01-31 11:59:09,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:59:09,859 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:59:09,872 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 11:59:09,901 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:59:09,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:09,955 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-01-31 11:59:10,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:10,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:10,063 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-01-31 11:59:10,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:10,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:10,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:10,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:10,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:10,456 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 57 [2022-01-31 11:59:10,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:10,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:10,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:10,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:10,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:10,805 INFO L353 Elim1Store]: treesize reduction 123, result has 23.6 percent of original size [2022-01-31 11:59:10,805 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 71 [2022-01-31 11:59:11,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:11,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:11,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:11,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:11,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:11,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:11,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:11,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:11,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:11,678 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:59:11,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:11,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:11,684 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:59:11,685 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 80 [2022-01-31 11:59:12,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,085 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:59:12,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,091 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:59:12,092 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 87 [2022-01-31 11:59:12,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:59:12,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,618 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:59:12,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 80 [2022-01-31 11:59:12,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:12,983 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:59:12,987 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:59:12,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 80 [2022-01-31 11:59:13,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:13,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:13,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:13,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:13,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:13,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:13,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:13,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:13,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:13,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:13,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:13,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:13,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:13,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:13,385 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:59:13,386 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 91 [2022-01-31 11:59:14,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:14,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:14,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:14,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:14,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:14,360 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:59:14,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:14,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:14,364 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:59:14,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:14,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:14,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:14,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:14,371 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 11 disjoint index pairs (out of 28 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 88 [2022-01-31 11:59:14,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:14,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:14,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:14,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:14,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:14,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:14,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:14,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:14,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:14,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:14,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:15,059 INFO L353 Elim1Store]: treesize reduction 109, result has 41.1 percent of original size [2022-01-31 11:59:15,059 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 93 treesize of output 127 [2022-01-31 11:59:17,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:17,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:17,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:17,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:17,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:17,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:17,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:17,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:17,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:17,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:17,509 INFO L353 Elim1Store]: treesize reduction 139, result has 35.6 percent of original size [2022-01-31 11:59:17,509 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 155 treesize of output 155 [2022-01-31 11:59:22,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:22,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:22,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:22,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:22,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:22,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:22,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:22,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:22,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:22,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:22,896 INFO L353 Elim1Store]: treesize reduction 149, result has 31.0 percent of original size [2022-01-31 11:59:22,896 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 180 treesize of output 162 [2022-01-31 11:59:23,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:23,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:23,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:23,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:23,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:23,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:23,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:23,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:23,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:23,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:23,990 INFO L353 Elim1Store]: treesize reduction 127, result has 41.2 percent of original size [2022-01-31 11:59:23,991 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 126 [2022-01-31 11:59:27,098 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-01-31 11:59:27,456 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 2 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:59:27,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:59:30,021 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int)) (or (< (+ main_~i~0 1) c_~N~0) (forall ((v_ArrVal_822 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 8)) v_ArrVal_822) c_main_~a~0.offset) (+ c_~N~0 1))))) is different from false [2022-01-31 11:59:32,051 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_819 Int) (v_ArrVal_822 Int) (v_main_~i~0_259 Int)) (or (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8)) v_ArrVal_819) (+ c_main_~a~0.offset (* 8 v_main_~i~0_259)) v_ArrVal_822) c_main_~a~0.offset) (+ c_~N~0 1)) (< (+ v_main_~i~0_259 1) c_~N~0))) is different from false [2022-01-31 11:59:34,099 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_260 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_260)) (forall ((v_ArrVal_819 Int) (v_ArrVal_822 Int) (v_main_~i~0_259 Int)) (or (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_260) c_main_~a~0.offset) v_ArrVal_819) (+ c_main_~a~0.offset (* 8 v_main_~i~0_259)) v_ArrVal_822) c_main_~a~0.offset) (+ c_~N~0 1)) (< (+ v_main_~i~0_259 1) c_~N~0))))) is different from false [2022-01-31 12:01:48,084 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_261 Int)) (or (forall ((v_ArrVal_819 Int) (v_ArrVal_817 Int) (v_main_~i~0_260 Int) (v_ArrVal_822 Int) (v_main_~i~0_259 Int)) (or (not (<= (+ v_main_~i~0_261 1) v_main_~i~0_260)) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_261)) v_ArrVal_817) (+ (* 8 v_main_~i~0_260) c_main_~a~0.offset) v_ArrVal_819) (+ c_main_~a~0.offset (* 8 v_main_~i~0_259)) v_ArrVal_822) c_main_~a~0.offset) (+ c_~N~0 1)) (< (+ v_main_~i~0_259 1) c_~N~0))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_261)))) is different from false