/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/verifythis/duplets.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-15 02:21:53,469 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 02:21:53,471 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 02:21:53,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 02:21:53,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 02:21:53,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 02:21:53,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 02:21:53,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 02:21:53,536 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 02:21:53,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 02:21:53,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 02:21:53,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 02:21:53,538 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 02:21:53,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 02:21:53,539 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 02:21:53,543 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 02:21:53,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 02:21:53,547 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 02:21:53,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 02:21:53,552 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 02:21:53,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 02:21:53,555 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 02:21:53,556 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 02:21:53,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 02:21:53,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 02:21:53,560 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 02:21:53,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 02:21:53,561 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 02:21:53,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 02:21:53,562 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 02:21:53,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 02:21:53,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 02:21:53,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 02:21:53,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 02:21:53,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 02:21:53,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 02:21:53,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 02:21:53,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 02:21:53,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 02:21:53,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 02:21:53,565 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 02:21:53,566 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-02-15 02:21:53,572 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 02:21:53,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 02:21:53,573 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 02:21:53,573 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-15 02:21:53,573 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 02:21:53,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-15 02:21:53,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 02:21:53,573 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 02:21:53,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 02:21:53,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 02:21:53,574 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-15 02:21:53,574 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 02:21:53,574 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 02:21:53,574 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 02:21:53,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 02:21:53,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 02:21:53,575 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 02:21:53,575 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 02:21:53,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 02:21:53,575 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 02:21:53,575 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-02-15 02:21:53,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-15 02:21:53,575 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-02-15 02:21:53,575 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-02-15 02:21:53,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 02:21:53,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 02:21:53,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 02:21:53,786 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 02:21:53,789 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 02:21:53,790 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/duplets.c [2022-02-15 02:21:53,835 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f34c4569b/7cdfa79608e0469e9c7aeb3b8e230ade/FLAGb5c1b5293 [2022-02-15 02:21:54,201 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 02:21:54,202 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c [2022-02-15 02:21:54,207 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f34c4569b/7cdfa79608e0469e9c7aeb3b8e230ade/FLAGb5c1b5293 [2022-02-15 02:21:54,223 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f34c4569b/7cdfa79608e0469e9c7aeb3b8e230ade [2022-02-15 02:21:54,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 02:21:54,227 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-15 02:21:54,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 02:21:54,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 02:21:54,233 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 02:21:54,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:21:54" (1/1) ... [2022-02-15 02:21:54,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19178e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:21:54, skipping insertion in model container [2022-02-15 02:21:54,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:21:54" (1/1) ... [2022-02-15 02:21:54,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 02:21:54,249 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 02:21:54,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c[485,498] [2022-02-15 02:21:54,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 02:21:54,397 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 02:21:54,404 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c[485,498] [2022-02-15 02:21:54,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 02:21:54,427 INFO L208 MainTranslator]: Completed translation [2022-02-15 02:21:54,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:21:54 WrapperNode [2022-02-15 02:21:54,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 02:21:54,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 02:21:54,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 02:21:54,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 02:21:54,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:21:54" (1/1) ... [2022-02-15 02:21:54,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:21:54" (1/1) ... [2022-02-15 02:21:54,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:21:54" (1/1) ... [2022-02-15 02:21:54,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:21:54" (1/1) ... [2022-02-15 02:21:54,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:21:54" (1/1) ... [2022-02-15 02:21:54,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:21:54" (1/1) ... [2022-02-15 02:21:54,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:21:54" (1/1) ... [2022-02-15 02:21:54,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 02:21:54,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 02:21:54,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 02:21:54,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 02:21:54,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:21:54" (1/1) ... [2022-02-15 02:21:54,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 02:21:54,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 02:21:54,495 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-02-15 02:21:54,501 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-02-15 02:21:54,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-15 02:21:54,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 02:21:54,527 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-15 02:21:54,527 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-15 02:21:54,527 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-15 02:21:54,527 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2022-02-15 02:21:54,527 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2022-02-15 02:21:54,527 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-15 02:21:54,527 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-15 02:21:54,527 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-02-15 02:21:54,527 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-02-15 02:21:54,528 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-15 02:21:54,528 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-15 02:21:54,528 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-15 02:21:54,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 02:21:54,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-15 02:21:54,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-15 02:21:54,528 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-15 02:21:54,528 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2022-02-15 02:21:54,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 02:21:54,528 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2022-02-15 02:21:54,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 02:21:54,528 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-15 02:21:54,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-15 02:21:54,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-15 02:21:54,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-15 02:21:54,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 02:21:54,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-15 02:21:54,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 02:21:54,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 02:21:54,619 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 02:21:54,629 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 02:21:54,830 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 02:21:54,834 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 02:21:54,835 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-15 02:21:54,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:21:54 BoogieIcfgContainer [2022-02-15 02:21:54,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 02:21:54,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 02:21:54,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 02:21:54,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 02:21:54,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 02:21:54" (1/3) ... [2022-02-15 02:21:54,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a166192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 02:21:54, skipping insertion in model container [2022-02-15 02:21:54,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:21:54" (2/3) ... [2022-02-15 02:21:54,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a166192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 02:21:54, skipping insertion in model container [2022-02-15 02:21:54,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:21:54" (3/3) ... [2022-02-15 02:21:54,846 INFO L111 eAbstractionObserver]: Analyzing ICFG duplets.c [2022-02-15 02:21:54,850 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-02-15 02:21:54,850 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-15 02:21:54,889 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 02:21:54,894 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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=JORDAN [2022-02-15 02:21:54,894 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-15 02:21:54,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-15 02:21:54,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-15 02:21:54,923 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:21:54,923 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:21:54,924 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:21:54,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:21:54,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1531213237, now seen corresponding path program 1 times [2022-02-15 02:21:54,939 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:21:54,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [550725850] [2022-02-15 02:21:54,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:21:54,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:21:54,991 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:21:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:55,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:21:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:55,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:21:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:55,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:21:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:55,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-15 02:21:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:55,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:21:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:55,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:21:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:55,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:21:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:55,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-15 02:21:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:55,231 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-15 02:21:55,232 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:21:55,233 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [550725850] [2022-02-15 02:21:55,234 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [550725850] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:21:55,234 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:21:55,234 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 02:21:55,235 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337413061] [2022-02-15 02:21:55,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:21:55,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 02:21:55,243 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:21:55,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 02:21:55,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 02:21:55,262 INFO L87 Difference]: Start difference. First operand has 59 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-15 02:21:55,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:21:55,428 INFO L93 Difference]: Finished difference Result 113 states and 153 transitions. [2022-02-15 02:21:55,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 02:21:55,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 49 [2022-02-15 02:21:55,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:21:55,438 INFO L225 Difference]: With dead ends: 113 [2022-02-15 02:21:55,438 INFO L226 Difference]: Without dead ends: 56 [2022-02-15 02:21:55,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-15 02:21:55,446 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 59 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 02:21:55,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 55 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 02:21:55,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-02-15 02:21:55,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2022-02-15 02:21:55,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-15 02:21:55,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-02-15 02:21:55,489 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 49 [2022-02-15 02:21:55,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:21:55,490 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-02-15 02:21:55,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-15 02:21:55,490 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-02-15 02:21:55,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-15 02:21:55,493 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:21:55,494 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:21:55,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 02:21:55,494 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:21:55,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:21:55,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1121655349, now seen corresponding path program 1 times [2022-02-15 02:21:55,495 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:21:55,496 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1776703293] [2022-02-15 02:21:55,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:21:55,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:21:55,501 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:21:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:55,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:21:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:55,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:21:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:55,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:21:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:55,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-15 02:21:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:55,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:21:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:55,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:21:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:55,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:21:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:55,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-15 02:21:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-15 02:21:55,760 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:21:55,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1776703293] [2022-02-15 02:21:55,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1776703293] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:21:55,760 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:21:55,760 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 02:21:55,760 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456143548] [2022-02-15 02:21:55,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:21:55,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 02:21:55,761 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:21:55,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 02:21:55,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-02-15 02:21:55,762 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-15 02:21:56,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:21:56,184 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2022-02-15 02:21:56,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-15 02:21:56,185 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 49 [2022-02-15 02:21:56,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:21:56,186 INFO L225 Difference]: With dead ends: 84 [2022-02-15 02:21:56,186 INFO L226 Difference]: Without dead ends: 63 [2022-02-15 02:21:56,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2022-02-15 02:21:56,188 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 95 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 02:21:56,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 58 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 02:21:56,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-02-15 02:21:56,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2022-02-15 02:21:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 35 states have internal predecessors, (40), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-15 02:21:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-02-15 02:21:56,198 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 49 [2022-02-15 02:21:56,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:21:56,199 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-02-15 02:21:56,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-15 02:21:56,199 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-02-15 02:21:56,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-15 02:21:56,200 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:21:56,200 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:21:56,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 02:21:56,200 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:21:56,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:21:56,201 INFO L85 PathProgramCache]: Analyzing trace with hash -2096379008, now seen corresponding path program 1 times [2022-02-15 02:21:56,201 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:21:56,201 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [330459307] [2022-02-15 02:21:56,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:21:56,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:21:56,203 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:21:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:56,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:21:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:56,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:21:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:56,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:21:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:56,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-15 02:21:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:56,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:21:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:56,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:21:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:56,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:21:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:56,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-15 02:21:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:56,339 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-15 02:21:56,339 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:21:56,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [330459307] [2022-02-15 02:21:56,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [330459307] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:21:56,340 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:21:56,340 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-15 02:21:56,340 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35985989] [2022-02-15 02:21:56,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:21:56,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 02:21:56,341 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:21:56,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 02:21:56,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-15 02:21:56,341 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-15 02:21:56,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:21:56,615 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-02-15 02:21:56,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 02:21:56,615 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 50 [2022-02-15 02:21:56,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:21:56,619 INFO L225 Difference]: With dead ends: 75 [2022-02-15 02:21:56,619 INFO L226 Difference]: Without dead ends: 73 [2022-02-15 02:21:56,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-02-15 02:21:56,622 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 79 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-15 02:21:56,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 65 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-15 02:21:56,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-15 02:21:56,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2022-02-15 02:21:56,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-02-15 02:21:56,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2022-02-15 02:21:56,636 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 50 [2022-02-15 02:21:56,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:21:56,636 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2022-02-15 02:21:56,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-15 02:21:56,636 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2022-02-15 02:21:56,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-15 02:21:56,637 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:21:56,637 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:21:56,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 02:21:56,637 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:21:56,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:21:56,638 INFO L85 PathProgramCache]: Analyzing trace with hash 983031743, now seen corresponding path program 1 times [2022-02-15 02:21:56,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:21:56,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [482261689] [2022-02-15 02:21:56,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:21:56,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:21:56,640 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:21:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:56,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:21:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:56,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:21:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:56,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:21:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:56,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-15 02:21:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:56,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:21:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:56,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:21:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:56,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:21:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:56,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-15 02:21:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-15 02:21:57,004 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:21:57,004 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [482261689] [2022-02-15 02:21:57,004 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [482261689] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:21:57,005 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:21:57,005 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-15 02:21:57,007 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661681656] [2022-02-15 02:21:57,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:21:57,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-15 02:21:57,011 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:21:57,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-15 02:21:57,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-02-15 02:21:57,013 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 15 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-15 02:21:57,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:21:57,586 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2022-02-15 02:21:57,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-15 02:21:57,586 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 52 [2022-02-15 02:21:57,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:21:57,587 INFO L225 Difference]: With dead ends: 114 [2022-02-15 02:21:57,587 INFO L226 Difference]: Without dead ends: 74 [2022-02-15 02:21:57,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=880, Unknown=0, NotChecked=0, Total=1056 [2022-02-15 02:21:57,589 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 123 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 02:21:57,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 66 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 02:21:57,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-02-15 02:21:57,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2022-02-15 02:21:57,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-02-15 02:21:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2022-02-15 02:21:57,596 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 52 [2022-02-15 02:21:57,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:21:57,596 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2022-02-15 02:21:57,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-15 02:21:57,597 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-02-15 02:21:57,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-15 02:21:57,597 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:21:57,597 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:21:57,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-15 02:21:57,598 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:21:57,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:21:57,598 INFO L85 PathProgramCache]: Analyzing trace with hash 2045094069, now seen corresponding path program 1 times [2022-02-15 02:21:57,598 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:21:57,598 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1516520951] [2022-02-15 02:21:57,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:21:57,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:21:57,599 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:21:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:57,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:21:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:57,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:21:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:57,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:21:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:57,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-15 02:21:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:57,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:21:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:57,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:21:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:57,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:21:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:57,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-15 02:21:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:57,682 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-15 02:21:57,682 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:21:57,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1516520951] [2022-02-15 02:21:57,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1516520951] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:21:57,682 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:21:57,683 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-15 02:21:57,683 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109441162] [2022-02-15 02:21:57,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:21:57,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-15 02:21:57,685 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:21:57,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-15 02:21:57,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-15 02:21:57,685 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-15 02:21:57,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:21:57,866 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2022-02-15 02:21:57,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 02:21:57,867 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2022-02-15 02:21:57,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:21:57,868 INFO L225 Difference]: With dead ends: 88 [2022-02-15 02:21:57,868 INFO L226 Difference]: Without dead ends: 67 [2022-02-15 02:21:57,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-02-15 02:21:57,869 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 65 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 02:21:57,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 53 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 02:21:57,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-02-15 02:21:57,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-02-15 02:21:57,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-02-15 02:21:57,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-02-15 02:21:57,879 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 55 [2022-02-15 02:21:57,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:21:57,879 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-02-15 02:21:57,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-15 02:21:57,880 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-02-15 02:21:57,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-15 02:21:57,880 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:21:57,880 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:21:57,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-15 02:21:57,881 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:21:57,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:21:57,881 INFO L85 PathProgramCache]: Analyzing trace with hash 629236887, now seen corresponding path program 1 times [2022-02-15 02:21:57,881 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:21:57,881 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1584680601] [2022-02-15 02:21:57,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:21:57,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:21:57,883 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:21:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:57,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:21:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:57,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:21:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:58,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:21:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:58,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-15 02:21:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:58,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:21:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:58,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:21:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:58,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:21:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:58,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-15 02:21:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:58,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-15 02:21:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:58,161 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-15 02:21:58,161 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:21:58,161 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1584680601] [2022-02-15 02:21:58,161 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1584680601] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:21:58,161 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:21:58,161 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-02-15 02:21:58,161 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829197278] [2022-02-15 02:21:58,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:21:58,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-15 02:21:58,165 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:21:58,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-15 02:21:58,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-02-15 02:21:58,166 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 17 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-15 02:21:58,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:21:58,806 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2022-02-15 02:21:58,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-15 02:21:58,806 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 57 [2022-02-15 02:21:58,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:21:58,807 INFO L225 Difference]: With dead ends: 101 [2022-02-15 02:21:58,807 INFO L226 Difference]: Without dead ends: 87 [2022-02-15 02:21:58,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2022-02-15 02:21:58,808 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 120 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-15 02:21:58,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 62 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-15 02:21:58,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-02-15 02:21:58,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 79. [2022-02-15 02:21:58,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 54 states have internal predecessors, (61), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2022-02-15 02:21:58,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2022-02-15 02:21:58,824 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 57 [2022-02-15 02:21:58,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:21:58,826 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2022-02-15 02:21:58,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-15 02:21:58,826 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-02-15 02:21:58,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-15 02:21:58,829 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:21:58,829 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:21:58,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-15 02:21:58,830 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:21:58,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:21:58,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1636680555, now seen corresponding path program 2 times [2022-02-15 02:21:58,830 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:21:58,830 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [729454522] [2022-02-15 02:21:58,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:21:58,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:21:58,831 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:21:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:58,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:21:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:58,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:21:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:58,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:21:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:58,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-15 02:21:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:59,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:21:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:59,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:21:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:59,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:21:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:59,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-15 02:21:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:21:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-15 02:21:59,431 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:21:59,431 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [729454522] [2022-02-15 02:21:59,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [729454522] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:21:59,431 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:21:59,431 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-02-15 02:21:59,431 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231903412] [2022-02-15 02:21:59,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:21:59,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-15 02:21:59,433 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:21:59,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-15 02:21:59,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2022-02-15 02:21:59,434 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 21 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 8 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-15 02:22:00,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:22:00,349 INFO L93 Difference]: Finished difference Result 140 states and 175 transitions. [2022-02-15 02:22:00,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-15 02:22:00,349 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 8 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 58 [2022-02-15 02:22:00,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:22:00,350 INFO L225 Difference]: With dead ends: 140 [2022-02-15 02:22:00,350 INFO L226 Difference]: Without dead ends: 102 [2022-02-15 02:22:00,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=226, Invalid=1580, Unknown=0, NotChecked=0, Total=1806 [2022-02-15 02:22:00,351 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 148 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 02:22:00,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 68 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 02:22:00,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-15 02:22:00,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 82. [2022-02-15 02:22:00,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 57 states have internal predecessors, (65), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2022-02-15 02:22:00,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2022-02-15 02:22:00,372 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 58 [2022-02-15 02:22:00,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:22:00,372 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2022-02-15 02:22:00,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 8 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-15 02:22:00,373 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-02-15 02:22:00,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-15 02:22:00,373 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:22:00,373 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:22:00,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-15 02:22:00,373 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:22:00,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:22:00,374 INFO L85 PathProgramCache]: Analyzing trace with hash 596047115, now seen corresponding path program 3 times [2022-02-15 02:22:00,374 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:22:00,374 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1507053078] [2022-02-15 02:22:00,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:22:00,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:22:00,375 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:22:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:00,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:22:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:00,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:22:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:00,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:22:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:00,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-15 02:22:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:00,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:22:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:00,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:22:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:00,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:22:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:00,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-15 02:22:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:00,439 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-15 02:22:00,440 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:22:00,440 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1507053078] [2022-02-15 02:22:00,440 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1507053078] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:22:00,440 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:22:00,440 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-15 02:22:00,440 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609571318] [2022-02-15 02:22:00,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:22:00,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 02:22:00,440 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:22:00,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 02:22:00,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-15 02:22:00,441 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-15 02:22:00,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:22:00,716 INFO L93 Difference]: Finished difference Result 129 states and 158 transitions. [2022-02-15 02:22:00,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 02:22:00,717 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2022-02-15 02:22:00,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:22:00,717 INFO L225 Difference]: With dead ends: 129 [2022-02-15 02:22:00,718 INFO L226 Difference]: Without dead ends: 92 [2022-02-15 02:22:00,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2022-02-15 02:22:00,718 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 71 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-15 02:22:00,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 59 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-15 02:22:00,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-02-15 02:22:00,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2022-02-15 02:22:00,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 63 states have internal predecessors, (73), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2022-02-15 02:22:00,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2022-02-15 02:22:00,730 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 61 [2022-02-15 02:22:00,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:22:00,730 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2022-02-15 02:22:00,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-15 02:22:00,730 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-02-15 02:22:00,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-15 02:22:00,731 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:22:00,731 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:22:00,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-15 02:22:00,731 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:22:00,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:22:00,731 INFO L85 PathProgramCache]: Analyzing trace with hash 645513954, now seen corresponding path program 1 times [2022-02-15 02:22:00,731 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:22:00,731 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [263988589] [2022-02-15 02:22:00,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:22:00,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:22:00,733 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:22:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:00,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:22:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:00,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:22:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:00,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:22:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:00,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-15 02:22:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:00,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:22:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:00,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:22:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:00,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:22:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:00,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-15 02:22:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:00,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-15 02:22:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:00,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-15 02:22:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:00,837 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-15 02:22:00,837 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:22:00,837 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [263988589] [2022-02-15 02:22:00,837 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [263988589] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:22:00,837 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:22:00,838 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-15 02:22:00,838 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883263999] [2022-02-15 02:22:00,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:22:00,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 02:22:00,838 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:22:00,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 02:22:00,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-15 02:22:00,839 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-15 02:22:01,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:22:01,094 INFO L93 Difference]: Finished difference Result 109 states and 134 transitions. [2022-02-15 02:22:01,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 02:22:01,094 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 64 [2022-02-15 02:22:01,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:22:01,095 INFO L225 Difference]: With dead ends: 109 [2022-02-15 02:22:01,095 INFO L226 Difference]: Without dead ends: 98 [2022-02-15 02:22:01,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-02-15 02:22:01,096 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 78 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-15 02:22:01,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 49 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-15 02:22:01,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-02-15 02:22:01,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2022-02-15 02:22:01,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 17 states have call predecessors, (18), 16 states have call successors, (18) [2022-02-15 02:22:01,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2022-02-15 02:22:01,108 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 64 [2022-02-15 02:22:01,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:22:01,109 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2022-02-15 02:22:01,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-15 02:22:01,109 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2022-02-15 02:22:01,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-15 02:22:01,109 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:22:01,109 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:22:01,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-15 02:22:01,110 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:22:01,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:22:01,110 INFO L85 PathProgramCache]: Analyzing trace with hash 643666912, now seen corresponding path program 1 times [2022-02-15 02:22:01,110 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:22:01,110 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [617917616] [2022-02-15 02:22:01,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:22:01,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:22:01,111 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:22:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:01,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:22:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:01,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:22:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:01,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:22:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:01,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-15 02:22:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:01,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:22:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:01,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:22:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:01,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:22:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:01,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-15 02:22:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:01,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-15 02:22:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:01,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-15 02:22:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:01,235 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-15 02:22:01,235 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:22:01,235 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [617917616] [2022-02-15 02:22:01,235 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [617917616] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:22:01,235 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:22:01,235 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-15 02:22:01,235 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019360394] [2022-02-15 02:22:01,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:22:01,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-15 02:22:01,235 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:22:01,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-15 02:22:01,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-02-15 02:22:01,236 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-15 02:22:01,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:22:01,585 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2022-02-15 02:22:01,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 02:22:01,586 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 64 [2022-02-15 02:22:01,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:22:01,586 INFO L225 Difference]: With dead ends: 104 [2022-02-15 02:22:01,586 INFO L226 Difference]: Without dead ends: 102 [2022-02-15 02:22:01,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2022-02-15 02:22:01,587 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 78 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-15 02:22:01,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 56 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-15 02:22:01,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-15 02:22:01,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2022-02-15 02:22:01,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 70 states have internal predecessors, (81), 19 states have call successors, (19), 10 states have call predecessors, (19), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2022-02-15 02:22:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2022-02-15 02:22:01,599 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 64 [2022-02-15 02:22:01,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:22:01,599 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2022-02-15 02:22:01,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-15 02:22:01,600 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2022-02-15 02:22:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-15 02:22:01,600 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:22:01,600 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:22:01,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-15 02:22:01,600 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:22:01,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:22:01,601 INFO L85 PathProgramCache]: Analyzing trace with hash -781730101, now seen corresponding path program 1 times [2022-02-15 02:22:01,601 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:22:01,601 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [984850441] [2022-02-15 02:22:01,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:22:01,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:22:01,602 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:22:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:01,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:22:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:01,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:22:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:01,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:22:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:01,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-15 02:22:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:01,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:22:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:01,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:22:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:01,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:22:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:01,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-15 02:22:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:01,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-15 02:22:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:01,910 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-15 02:22:01,911 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:22:01,911 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [984850441] [2022-02-15 02:22:01,911 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [984850441] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:22:01,911 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:22:01,911 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-02-15 02:22:01,911 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117379967] [2022-02-15 02:22:01,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:22:01,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-15 02:22:01,911 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:22:01,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-15 02:22:01,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-02-15 02:22:01,912 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand has 19 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-15 02:22:02,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:22:02,558 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2022-02-15 02:22:02,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-15 02:22:02,558 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 66 [2022-02-15 02:22:02,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:22:02,559 INFO L225 Difference]: With dead ends: 111 [2022-02-15 02:22:02,559 INFO L226 Difference]: Without dead ends: 109 [2022-02-15 02:22:02,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=950, Unknown=0, NotChecked=0, Total=1122 [2022-02-15 02:22:02,560 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 121 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-15 02:22:02,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 62 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-15 02:22:02,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-02-15 02:22:02,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2022-02-15 02:22:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 70 states have internal predecessors, (81), 19 states have call successors, (19), 10 states have call predecessors, (19), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2022-02-15 02:22:02,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2022-02-15 02:22:02,572 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 66 [2022-02-15 02:22:02,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:22:02,572 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2022-02-15 02:22:02,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-15 02:22:02,573 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2022-02-15 02:22:02,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-15 02:22:02,573 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:22:02,573 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:22:02,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-15 02:22:02,573 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:22:02,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:22:02,574 INFO L85 PathProgramCache]: Analyzing trace with hash -779883059, now seen corresponding path program 1 times [2022-02-15 02:22:02,574 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:22:02,574 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1524182736] [2022-02-15 02:22:02,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:22:02,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:22:02,575 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:22:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:02,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:22:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:02,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:22:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:02,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:22:02,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:02,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-15 02:22:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:02,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:22:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:02,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:22:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:02,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:22:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:02,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-15 02:22:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:02,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-15 02:22:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:02,735 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-15 02:22:02,735 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:22:02,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1524182736] [2022-02-15 02:22:02,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1524182736] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:22:02,735 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:22:02,735 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-15 02:22:02,735 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542595852] [2022-02-15 02:22:02,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:22:02,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-15 02:22:02,736 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:22:02,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-15 02:22:02,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-02-15 02:22:02,736 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-15 02:22:03,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:22:03,245 INFO L93 Difference]: Finished difference Result 124 states and 148 transitions. [2022-02-15 02:22:03,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-15 02:22:03,245 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 66 [2022-02-15 02:22:03,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:22:03,246 INFO L225 Difference]: With dead ends: 124 [2022-02-15 02:22:03,246 INFO L226 Difference]: Without dead ends: 106 [2022-02-15 02:22:03,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2022-02-15 02:22:03,247 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 78 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 02:22:03,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 69 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 02:22:03,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-02-15 02:22:03,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2022-02-15 02:22:03,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 62 states have internal predecessors, (71), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-02-15 02:22:03,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2022-02-15 02:22:03,258 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 66 [2022-02-15 02:22:03,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:22:03,258 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2022-02-15 02:22:03,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-15 02:22:03,259 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2022-02-15 02:22:03,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-15 02:22:03,259 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:22:03,259 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:22:03,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-15 02:22:03,259 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:22:03,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:22:03,259 INFO L85 PathProgramCache]: Analyzing trace with hash 297933182, now seen corresponding path program 1 times [2022-02-15 02:22:03,260 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:22:03,260 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1155084982] [2022-02-15 02:22:03,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:22:03,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:22:03,261 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:22:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:03,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:22:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:03,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:22:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:03,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:22:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:03,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-15 02:22:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:03,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:22:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:03,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:22:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:03,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:22:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:03,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-15 02:22:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:03,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-15 02:22:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:03,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-15 02:22:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:03,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-02-15 02:22:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:03,487 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-15 02:22:03,487 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:22:03,487 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1155084982] [2022-02-15 02:22:03,487 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1155084982] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:22:03,487 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:22:03,487 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-15 02:22:03,487 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254991759] [2022-02-15 02:22:03,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:22:03,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-15 02:22:03,488 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:22:03,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-15 02:22:03,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-02-15 02:22:03,488 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand has 16 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 6 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-02-15 02:22:03,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:22:03,971 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2022-02-15 02:22:03,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-15 02:22:03,971 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 6 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 70 [2022-02-15 02:22:03,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:22:03,972 INFO L225 Difference]: With dead ends: 110 [2022-02-15 02:22:03,972 INFO L226 Difference]: Without dead ends: 108 [2022-02-15 02:22:03,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2022-02-15 02:22:03,973 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 111 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 02:22:03,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 58 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 02:22:03,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-02-15 02:22:03,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2022-02-15 02:22:03,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 73 states have internal predecessors, (83), 21 states have call successors, (21), 10 states have call predecessors, (21), 10 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-02-15 02:22:03,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2022-02-15 02:22:03,987 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 70 [2022-02-15 02:22:03,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:22:03,987 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2022-02-15 02:22:03,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 6 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-02-15 02:22:03,987 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2022-02-15 02:22:03,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-15 02:22:03,988 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:22:03,988 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:22:03,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-15 02:22:03,988 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:22:03,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:22:03,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1867983073, now seen corresponding path program 4 times [2022-02-15 02:22:03,988 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:22:03,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [404971492] [2022-02-15 02:22:03,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:22:03,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:22:03,990 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:22:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:04,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:22:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:04,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:22:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:04,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:22:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:04,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-15 02:22:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:05,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:22:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:05,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:22:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:05,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:22:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:05,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-15 02:22:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:07,347 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-15 02:22:07,348 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:22:07,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [404971492] [2022-02-15 02:22:07,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [404971492] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:22:07,348 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:22:07,348 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-02-15 02:22:07,348 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460751706] [2022-02-15 02:22:07,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:22:07,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-15 02:22:07,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:22:07,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-15 02:22:07,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2022-02-15 02:22:07,349 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand has 27 states, 25 states have (on average 1.68) internal successors, (42), 23 states have internal predecessors, (42), 5 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-15 02:22:10,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:22:10,465 INFO L93 Difference]: Finished difference Result 175 states and 215 transitions. [2022-02-15 02:22:10,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-02-15 02:22:10,465 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.68) internal successors, (42), 23 states have internal predecessors, (42), 5 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 67 [2022-02-15 02:22:10,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:22:10,467 INFO L225 Difference]: With dead ends: 175 [2022-02-15 02:22:10,467 INFO L226 Difference]: Without dead ends: 119 [2022-02-15 02:22:10,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=386, Invalid=2694, Unknown=0, NotChecked=0, Total=3080 [2022-02-15 02:22:10,486 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 186 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-15 02:22:10,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 65 Invalid, 1863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1723 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-02-15 02:22:10,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-02-15 02:22:10,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2022-02-15 02:22:10,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 79 states have internal predecessors, (90), 21 states have call successors, (21), 10 states have call predecessors, (21), 10 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-02-15 02:22:10,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2022-02-15 02:22:10,505 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 132 transitions. Word has length 67 [2022-02-15 02:22:10,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:22:10,505 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 132 transitions. [2022-02-15 02:22:10,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.68) internal successors, (42), 23 states have internal predecessors, (42), 5 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-15 02:22:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2022-02-15 02:22:10,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-15 02:22:10,506 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:22:10,506 INFO L514 BasicCegarLoop]: trace histogram [5, 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, 1, 1, 1, 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-02-15 02:22:10,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-15 02:22:10,506 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:22:10,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:22:10,506 INFO L85 PathProgramCache]: Analyzing trace with hash 680409498, now seen corresponding path program 1 times [2022-02-15 02:22:10,506 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:22:10,507 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [735941289] [2022-02-15 02:22:10,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:22:10,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:22:10,508 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:22:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:10,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:22:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:10,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:22:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:10,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:22:10,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:10,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-15 02:22:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:10,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:22:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:10,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:22:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:10,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:22:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:10,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-15 02:22:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:10,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-15 02:22:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:10,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-15 02:22:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:10,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-02-15 02:22:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:10,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-02-15 02:22:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:10,887 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-15 02:22:10,888 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:22:10,888 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [735941289] [2022-02-15 02:22:10,888 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [735941289] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:22:10,888 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:22:10,888 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-02-15 02:22:10,888 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707514793] [2022-02-15 02:22:10,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:22:10,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-15 02:22:10,888 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:22:10,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-15 02:22:10,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-02-15 02:22:10,889 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand has 19 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-02-15 02:22:11,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:22:11,778 INFO L93 Difference]: Finished difference Result 123 states and 150 transitions. [2022-02-15 02:22:11,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-15 02:22:11,778 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 76 [2022-02-15 02:22:11,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:22:11,779 INFO L225 Difference]: With dead ends: 123 [2022-02-15 02:22:11,779 INFO L226 Difference]: Without dead ends: 103 [2022-02-15 02:22:11,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=1009, Unknown=0, NotChecked=0, Total=1190 [2022-02-15 02:22:11,780 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 145 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 02:22:11,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 68 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 02:22:11,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-02-15 02:22:11,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-02-15 02:22:11,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 75 states have internal predecessors, (85), 20 states have call successors, (20), 10 states have call predecessors, (20), 9 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-02-15 02:22:11,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2022-02-15 02:22:11,799 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 76 [2022-02-15 02:22:11,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:22:11,799 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2022-02-15 02:22:11,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-02-15 02:22:11,799 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2022-02-15 02:22:11,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-15 02:22:11,799 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:22:11,800 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:22:11,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-15 02:22:11,800 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:22:11,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:22:11,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1166734282, now seen corresponding path program 1 times [2022-02-15 02:22:11,800 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:22:11,800 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1038282197] [2022-02-15 02:22:11,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:22:11,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:22:11,801 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:22:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:11,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:22:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:11,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:22:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:11,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:22:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:11,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-15 02:22:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:11,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:22:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:11,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:22:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:11,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:22:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:11,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-15 02:22:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:11,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-15 02:22:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:12,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-02-15 02:22:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:12,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-15 02:22:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:12,014 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-15 02:22:12,014 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:22:12,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1038282197] [2022-02-15 02:22:12,014 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1038282197] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:22:12,014 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:22:12,014 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-15 02:22:12,014 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827529321] [2022-02-15 02:22:12,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:22:12,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-15 02:22:12,014 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:22:12,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-15 02:22:12,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-02-15 02:22:12,015 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand has 16 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 6 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-02-15 02:22:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:22:12,431 INFO L93 Difference]: Finished difference Result 111 states and 132 transitions. [2022-02-15 02:22:12,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-15 02:22:12,431 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 6 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 79 [2022-02-15 02:22:12,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:22:12,432 INFO L225 Difference]: With dead ends: 111 [2022-02-15 02:22:12,432 INFO L226 Difference]: Without dead ends: 109 [2022-02-15 02:22:12,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2022-02-15 02:22:12,432 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 98 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 02:22:12,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 59 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 02:22:12,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-02-15 02:22:12,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2022-02-15 02:22:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 74 states have (on average 1.162162162162162) internal successors, (86), 76 states have internal predecessors, (86), 21 states have call successors, (21), 10 states have call predecessors, (21), 9 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-02-15 02:22:12,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2022-02-15 02:22:12,451 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 79 [2022-02-15 02:22:12,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:22:12,451 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2022-02-15 02:22:12,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 6 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-02-15 02:22:12,451 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2022-02-15 02:22:12,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-15 02:22:12,451 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:22:12,451 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:22:12,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-15 02:22:12,452 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:22:12,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:22:12,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1727442411, now seen corresponding path program 5 times [2022-02-15 02:22:12,452 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:22:12,452 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1527086526] [2022-02-15 02:22:12,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:22:12,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:22:12,453 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:22:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:12,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:22:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:12,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:22:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:12,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:22:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:12,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-15 02:22:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:12,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:22:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:12,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:22:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:12,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:22:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:12,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-15 02:22:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:12,522 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-15 02:22:12,522 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:22:12,522 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1527086526] [2022-02-15 02:22:12,522 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1527086526] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:22:12,522 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:22:12,522 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-15 02:22:12,522 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831331366] [2022-02-15 02:22:12,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:22:12,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-15 02:22:12,522 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:22:12,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-15 02:22:12,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-02-15 02:22:12,523 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-15 02:22:12,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:22:12,840 INFO L93 Difference]: Finished difference Result 198 states and 242 transitions. [2022-02-15 02:22:12,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-15 02:22:12,840 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2022-02-15 02:22:12,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:22:12,841 INFO L225 Difference]: With dead ends: 198 [2022-02-15 02:22:12,841 INFO L226 Difference]: Without dead ends: 133 [2022-02-15 02:22:12,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2022-02-15 02:22:12,842 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 109 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-15 02:22:12,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 55 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-15 02:22:12,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-02-15 02:22:12,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 121. [2022-02-15 02:22:12,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 90 states have (on average 1.1666666666666667) internal successors, (105), 92 states have internal predecessors, (105), 21 states have call successors, (21), 10 states have call predecessors, (21), 9 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-02-15 02:22:12,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 145 transitions. [2022-02-15 02:22:12,870 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 145 transitions. Word has length 76 [2022-02-15 02:22:12,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:22:12,871 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 145 transitions. [2022-02-15 02:22:12,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-15 02:22:12,871 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 145 transitions. [2022-02-15 02:22:12,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-15 02:22:12,871 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:22:12,871 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:22:12,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-15 02:22:12,872 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:22:12,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:22:12,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1008133877, now seen corresponding path program 6 times [2022-02-15 02:22:12,872 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:22:12,872 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [848734318] [2022-02-15 02:22:12,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:22:12,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:22:12,873 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:22:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:13,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:22:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:13,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:22:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:13,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:22:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:13,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-15 02:22:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:13,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:22:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:13,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:22:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:13,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:22:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:13,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-15 02:22:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:18,335 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-15 02:22:18,335 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:22:18,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [848734318] [2022-02-15 02:22:18,335 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [848734318] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:22:18,335 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:22:18,336 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-02-15 02:22:18,336 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080142565] [2022-02-15 02:22:18,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:22:18,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-02-15 02:22:18,336 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:22:18,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-02-15 02:22:18,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2022-02-15 02:22:18,337 INFO L87 Difference]: Start difference. First operand 121 states and 145 transitions. Second operand has 35 states, 33 states have (on average 1.606060606060606) internal successors, (53), 31 states have internal predecessors, (53), 5 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-15 02:22:27,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:22:27,841 INFO L93 Difference]: Finished difference Result 158 states and 192 transitions. [2022-02-15 02:22:27,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-02-15 02:22:27,842 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 1.606060606060606) internal successors, (53), 31 states have internal predecessors, (53), 5 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 79 [2022-02-15 02:22:27,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:22:27,842 INFO L225 Difference]: With dead ends: 158 [2022-02-15 02:22:27,842 INFO L226 Difference]: Without dead ends: 124 [2022-02-15 02:22:27,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1361 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=679, Invalid=5021, Unknown=0, NotChecked=0, Total=5700 [2022-02-15 02:22:27,844 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 112 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2552 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 2657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-02-15 02:22:27,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 64 Invalid, 2657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2552 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-02-15 02:22:27,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-02-15 02:22:27,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 115. [2022-02-15 02:22:27,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 84 states have (on average 1.1666666666666667) internal successors, (98), 86 states have internal predecessors, (98), 21 states have call successors, (21), 10 states have call predecessors, (21), 9 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2022-02-15 02:22:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 138 transitions. [2022-02-15 02:22:27,870 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 138 transitions. Word has length 79 [2022-02-15 02:22:27,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:22:27,870 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 138 transitions. [2022-02-15 02:22:27,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 1.606060606060606) internal successors, (53), 31 states have internal predecessors, (53), 5 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-15 02:22:27,871 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 138 transitions. [2022-02-15 02:22:27,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-02-15 02:22:27,871 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:22:27,871 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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, 1, 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-02-15 02:22:27,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-15 02:22:27,871 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:22:27,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:22:27,872 INFO L85 PathProgramCache]: Analyzing trace with hash 690301670, now seen corresponding path program 1 times [2022-02-15 02:22:27,872 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:22:27,872 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1856934188] [2022-02-15 02:22:27,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:22:27,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:22:27,873 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:22:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:28,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:22:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:28,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:22:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:28,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:22:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:28,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-15 02:22:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:28,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:22:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:28,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:22:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:28,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:22:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:28,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-15 02:22:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:28,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-15 02:22:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:28,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-02-15 02:22:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:28,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-15 02:22:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:28,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-02-15 02:22:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:28,702 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-02-15 02:22:28,703 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:22:28,703 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1856934188] [2022-02-15 02:22:28,703 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1856934188] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:22:28,703 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:22:28,703 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-02-15 02:22:28,703 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074839095] [2022-02-15 02:22:28,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:22:28,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-15 02:22:28,703 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:22:28,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-15 02:22:28,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2022-02-15 02:22:28,704 INFO L87 Difference]: Start difference. First operand 115 states and 138 transitions. Second operand has 25 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 8 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2022-02-15 02:22:29,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:22:29,828 INFO L93 Difference]: Finished difference Result 121 states and 144 transitions. [2022-02-15 02:22:29,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-15 02:22:29,828 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 8 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) Word has length 85 [2022-02-15 02:22:29,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:22:29,829 INFO L225 Difference]: With dead ends: 121 [2022-02-15 02:22:29,829 INFO L226 Difference]: Without dead ends: 89 [2022-02-15 02:22:29,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=213, Invalid=1767, Unknown=0, NotChecked=0, Total=1980 [2022-02-15 02:22:29,830 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 124 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-15 02:22:29,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 76 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-15 02:22:29,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-15 02:22:29,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-02-15 02:22:29,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.123076923076923) internal successors, (73), 67 states have internal predecessors, (73), 17 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-15 02:22:29,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2022-02-15 02:22:29,852 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 85 [2022-02-15 02:22:29,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:22:29,852 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2022-02-15 02:22:29,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 8 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2022-02-15 02:22:29,852 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2022-02-15 02:22:29,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-15 02:22:29,852 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:22:29,852 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:22:29,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-15 02:22:29,853 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:22:29,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:22:29,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1189526721, now seen corresponding path program 7 times [2022-02-15 02:22:29,853 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:22:29,853 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [851987887] [2022-02-15 02:22:29,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:22:29,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:22:29,854 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:22:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:29,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:22:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:29,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:22:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:29,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:22:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:29,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-15 02:22:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:29,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:22:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:29,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:22:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:29,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:22:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:29,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-15 02:22:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:22:29,926 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-15 02:22:29,927 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:22:29,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [851987887] [2022-02-15 02:22:29,927 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [851987887] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:22:29,927 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:22:29,927 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-15 02:22:29,927 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467005559] [2022-02-15 02:22:29,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:22:29,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-15 02:22:29,927 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:22:29,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-15 02:22:29,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-02-15 02:22:29,928 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-15 02:22:30,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:22:30,156 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2022-02-15 02:22:30,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-15 02:22:30,157 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2022-02-15 02:22:30,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:22:30,157 INFO L225 Difference]: With dead ends: 89 [2022-02-15 02:22:30,157 INFO L226 Difference]: Without dead ends: 0 [2022-02-15 02:22:30,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2022-02-15 02:22:30,158 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 35 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 02:22:30,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 35 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 02:22:30,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-15 02:22:30,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-15 02:22:30,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 02:22:30,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-15 02:22:30,159 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2022-02-15 02:22:30,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:22:30,159 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-15 02:22:30,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-15 02:22:30,160 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-15 02:22:30,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-15 02:22:30,162 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-15 02:22:30,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-15 02:22:30,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-15 02:22:47,986 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-02-15 02:22:47,986 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-02-15 02:22:47,986 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-02-15 02:22:47,987 INFO L854 garLoopResultBuilder]: At program point finddupENTRY(lines 33 46) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-02-15 02:22:47,987 INFO L854 garLoopResultBuilder]: At program point finddupEXIT(lines 33 46) the Hoare annotation is: (let ((.cse32 (select |old(#memory_int)| |finddup_#in~a.base|)) (.cse27 ((as const (Array Int Int)) 0))) (let ((.cse33 (@diff .cse32 .cse27)) (.cse22 (= |finddup_#in~_i.base| |finddup_#in~_j.base|)) (.cse34 (= finddup_~_i.base finddup_~_j.base))) (let ((.cse17 (= finddup_~i~1 0)) (.cse9 (or .cse34 (= |finddup_#in~_i.base| finddup_~_i.base))) (.cse0 (<= 1 |finddup_#res|)) (.cse11 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse1 (= |finddup_#in~n| finddup_~n)) (.cse12 (<= 1 finddup_~i~1)) (.cse13 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse24 (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|)) (.cse4 (<= (+ finddup_~i~1 1) finddup_~j~1)) (.cse5 (<= |finddup_#res| 1)) (.cse15 (= |finddup_#in~_i.offset| finddup_~_i.offset)) (.cse16 (or .cse22 (not .cse34))) (.cse25 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|)) (.cse26 (store .cse32 .cse33 0))) (let ((.cse2 (not (= (select .cse32 (+ |finddup_#in~a.offset| 4)) (select .cse32 |finddup_#in~a.offset|)))) (.cse3 (<= finddup_~n 2)) (.cse7 (= |#memory_int| |old(#memory_int)|)) (.cse19 (= finddup_~a.offset |finddup_#in~a.offset|)) (.cse21 (= |finddup_#in~a.base| finddup_~a.base)) (.cse10 (let ((.cse31 (@diff .cse26 .cse27))) (or (not (= .cse27 (store .cse26 .cse31 0))) (not (= (select .cse32 .cse31) (select .cse32 .cse33)))))) (.cse20 (let ((.cse28 (<= (+ .cse25 1) |finddup_#in~n|)) (.cse29 (<= 1 .cse25)) (.cse30 (<= (+ finddup_~j~1 1) finddup_~n))) (or (and .cse9 .cse0 .cse11 (or .cse22 (= .cse24 0)) .cse1 .cse17 .cse28 .cse29 .cse13 .cse4 .cse5 .cse30 .cse15 .cse16) (and (or .cse22 (<= (+ .cse24 2) |finddup_#in~n|)) .cse9 .cse0 .cse11 .cse1 .cse28 .cse12 .cse29 .cse13 (or .cse22 (<= 1 .cse24)) .cse4 .cse5 .cse30 .cse15 .cse16)))) (.cse14 (not (= .cse26 .cse27))) (.cse8 (<= finddup_~n 1)) (.cse6 (<= finddup_~j~1 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse8) (and (<= finddup_~j~1 2) .cse7 .cse1 .cse2 .cse3) (and .cse9 .cse10 .cse7 .cse11 .cse1 .cse12 (<= 1 finddup_~j~1) .cse13 .cse14 .cse15 .cse16) (let ((.cse18 (= finddup_~a.offset 0))) (and (not (= |finddup_#in~a.offset| 0)) .cse17 (or .cse18 .cse19) .cse20 (or (not .cse18) .cse21))) (and (or .cse22 (= |finddup_#in~_j.base| |finddup_#in~a.base|) (= |finddup_#in~_i.base| |finddup_#in~a.base|) (let ((.cse23 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse23 (+ |finddup_#in~a.offset| (* .cse24 4))) (select .cse23 (+ |finddup_#in~a.offset| (* .cse25 4)))))) .cse20 .cse19 .cse21 (or (<= (+ .cse24 1) .cse25) .cse22)) (and .cse10 .cse20 .cse14) (and (<= finddup_~i~1 0) .cse0 .cse1 .cse8 .cse5 .cse6)))))) [2022-02-15 02:22:47,987 INFO L854 garLoopResultBuilder]: At program point L38(lines 38 42) the Hoare annotation is: (let ((.cse45 (select |#memory_int| finddup_~a.base)) (.cse59 ((as const (Array Int Int)) 0))) (let ((.cse46 (@diff .cse45 .cse59)) (.cse50 (* finddup_~i~1 4))) (let ((.cse67 (+ finddup_~a.offset .cse50)) (.cse65 (store .cse45 .cse46 0))) (let ((.cse64 (* (- 1) finddup_~a.offset)) (.cse49 (@diff .cse65 .cse59)) (.cse66 (* finddup_~a.offset 3)) (.cse56 (* finddup_~j~1 4)) (.cse36 (select .cse45 .cse67)) (.cse61 (select |old(#memory_int)| |finddup_#in~a.base|))) (let ((.cse62 (@diff .cse61 .cse59)) (.cse51 (= .cse36 0)) (.cse52 (+ finddup_~a.offset .cse56)) (.cse38 (+ finddup_~j~1 1)) (.cse23 (= (mod (+ .cse49 .cse66) 4) 0)) (.cse24 (not (= .cse59 .cse65))) (.cse28 (not (= .cse67 .cse49))) (.cse54 (+ finddup_~i~1 2)) (.cse30 (not (= .cse67 .cse46))) (.cse20 (= (mod (+ .cse66 .cse46) 4) 0)) (.cse53 (not (= .cse59 (store .cse65 .cse49 0)))) (.cse26 (div (+ .cse49 .cse64) 4)) (.cse29 (div (+ .cse64 .cse46) 4))) (let ((.cse19 (not (= .cse59 .cse45))) (.cse21 (<= .cse29 finddup_~i~1)) (.cse22 (<= .cse26 finddup_~i~1)) (.cse1 (= |#memory_int| |old(#memory_int)|)) (.cse32 (or (and .cse23 (<= .cse54 .cse26) .cse24) (and (<= (+ .cse26 4) finddup_~n) .cse23 .cse24 .cse28) (and (<= .cse54 .cse29) .cse20) (and (<= (+ .cse29 4) finddup_~n) .cse30 .cse20) .cse53)) (.cse14 (<= 1 finddup_~i~1)) (.cse2 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse3 (= |finddup_#in~n| finddup_~n)) (.cse6 (= finddup_~a.offset |finddup_#in~a.offset|)) (.cse7 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse8 (= |finddup_#in~a.base| finddup_~a.base)) (.cse35 (<= .cse38 finddup_~n)) (.cse11 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse12 (= |finddup_#in~_i.offset| finddup_~_i.offset)) (.cse37 (select .cse45 .cse52)) (.cse31 (not .cse51)) (.cse39 (= |finddup_#t~mem11| |finddup_#t~mem10|)) (.cse58 (store .cse61 .cse62 0)) (.cse63 (+ finddup_~i~1 1))) (let ((.cse0 (select .cse61 (+ |finddup_#in~a.offset| 4))) (.cse4 (select .cse61 |finddup_#in~a.offset|)) (.cse5 (<= finddup_~j~1 .cse63)) (.cse9 (<= .cse63 finddup_~j~1)) (.cse33 (let ((.cse60 (@diff .cse58 .cse59))) (or (not (= .cse59 (store .cse58 .cse60 0))) (not (= (select .cse61 .cse60) (select .cse61 .cse62)))))) (.cse34 (not (= .cse58 .cse59))) (.cse18 (or (not (= .cse37 0)) .cse31 .cse39)) (.cse44 (= |finddup_#t~mem10| .cse36)) (.cse25 (let ((.cse57 (<= .cse54 finddup_~j~1))) (or (and .cse2 .cse3 .cse57 .cse14 .cse7 .cse35 .cse11 .cse12) (and .cse2 .cse3 .cse57 .cse6 .cse7 (<= 0 finddup_~i~1) .cse8 .cse35 .cse11 .cse12)))) (.cse15 (or (= |finddup_#in~_j.base| |finddup_#in~a.base|) (= |finddup_#in~_i.base| |finddup_#in~a.base|) (let ((.cse55 (select |#memory_int| |finddup_#in~a.base|))) (and (= |finddup_#t~mem11| (select .cse55 (+ .cse56 |finddup_#in~a.offset|))) (= (select .cse55 (+ |finddup_#in~a.offset| .cse50)) |finddup_#t~mem10|))))) (.cse43 (<= finddup_~j~1 .cse54)) (.cse16 (or .cse51 (and .cse1 .cse32 .cse8))) (.cse13 (<= (+ finddup_~j~1 2) finddup_~n)) (.cse17 (or .cse31 (and (or (and .cse19 .cse20 .cse21 (<= (+ 3 .cse29) finddup_~n)) .cse53 (and (<= (+ 3 .cse26) finddup_~n) .cse22 .cse23 .cse24)) .cse1 .cse8))) (.cse10 (<= finddup_~j~1 1))) (or (and (= .cse0 |finddup_#t~mem11|) .cse1 .cse2 .cse3 (<= 1 finddup_~j~1) (= |finddup_#t~mem10| .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse13 .cse14 .cse15 .cse5 .cse6 .cse7 .cse9 .cse16 .cse17 .cse11 .cse18 .cse12) (and (or (and (or (and .cse19 .cse20 .cse21) (and .cse22 .cse23 .cse24)) .cse25 (let ((.cse27 (+ finddup_~i~1 finddup_~n))) (or (and (<= (+ finddup_~j~1 .cse26 1) .cse27) .cse23 .cse24 .cse28) (and (<= (+ finddup_~j~1 .cse29 1) .cse27) .cse30 .cse20))) .cse18) (and .cse31 .cse32 .cse25)) .cse1 .cse15 .cse6 .cse8 (<= (+ finddup_~i~1 3) finddup_~j~1)) (and .cse33 .cse1 .cse2 .cse3 .cse14 .cse7 .cse34 .cse9 .cse35 .cse11 .cse12) (and .cse1 .cse3 (not (= .cse0 .cse4)) (<= finddup_~n 2) .cse9 .cse10) (and (= .cse36 .cse37) .cse1 .cse2 (<= finddup_~n .cse38) .cse3 .cse39 .cse15 .cse5 .cse6 .cse7 .cse8 (<= 3 finddup_~n) .cse9 .cse35 .cse11 .cse12) (and .cse33 .cse1 .cse25 .cse34) (and (let ((.cse48 (+ finddup_~a.offset .cse50 4))) (let ((.cse41 (= .cse48 .cse46)) (.cse40 (and (= .cse49 .cse48) .cse24)) (.cse42 (= finddup_~i~1 0))) (or (and (or .cse40 .cse41) .cse1 .cse42 .cse25 .cse43 .cse44 (not (= .cse36 (select .cse45 .cse46)))) (let ((.cse47 (+ finddup_~a.offset .cse50 8))) (and (= (select .cse45 .cse47) (select .cse45 .cse48)) .cse1 (or (and .cse41 (= .cse49 .cse47)) .cse31 .cse40) .cse42 .cse25))))) .cse15 .cse18) (and (or (and (= |finddup_#t~mem11| .cse37) .cse44) .cse51) .cse25 .cse15 .cse6 .cse43 .cse16 (or (and (not (= .cse52 .cse49)) .cse39 (not (= .cse52 .cse46)) .cse24) .cse31 .cse13) .cse17) (and (<= finddup_~i~1 0) .cse1 .cse3 (<= finddup_~n 1) .cse10))))))))) [2022-02-15 02:22:47,987 INFO L854 garLoopResultBuilder]: At program point L36-2(lines 36 44) the Hoare annotation is: (let ((.cse40 (select |#memory_int| finddup_~a.base)) (.cse43 ((as const (Array Int Int)) 0))) (let ((.cse31 (@diff .cse40 .cse43))) (let ((.cse3 (select |old(#memory_int)| |finddup_#in~a.base|)) (.cse46 (store .cse40 .cse31 0)) (.cse41 (* finddup_~i~1 4))) (let ((.cse28 (+ finddup_~a.offset .cse41)) (.cse29 (@diff .cse46 .cse43)) (.cse48 (* finddup_~a.offset 3)) (.cse47 (* (- 1) finddup_~a.offset)) (.cse45 (@diff .cse3 .cse43)) (.cse33 (+ finddup_~a.offset .cse41 8))) (let ((.cse39 (+ finddup_~i~1 2)) (.cse37 (select .cse40 .cse33)) (.cse32 (+ finddup_~a.offset .cse41 4)) (.cse42 (store .cse3 .cse45 0)) (.cse13 (+ finddup_~i~1 1)) (.cse14 (div (+ .cse47 .cse31) 4)) (.cse15 (= (mod (+ .cse48 .cse31) 4) 0)) (.cse10 (= (mod (+ .cse29 .cse48) 4) 0)) (.cse11 (not (= .cse43 .cse46))) (.cse38 (+ finddup_~i~1 3)) (.cse12 (div (+ .cse29 .cse47) 4)) (.cse34 (not (= (select .cse40 .cse28) 0)))) (let ((.cse9 (<= (+ finddup_~i~1 4) finddup_~n)) (.cse22 (or (and (<= .cse38 .cse14) .cse15) (and .cse10 .cse11 (<= .cse38 .cse12)) .cse34 (not (= .cse43 (store .cse46 .cse29 0))))) (.cse2 (<= .cse13 finddup_~n)) (.cse25 (let ((.cse44 (@diff .cse42 .cse43))) (or (not (= .cse43 (store .cse42 .cse44 0))) (not (= (select .cse3 .cse44) (select .cse3 .cse45)))))) (.cse26 (not (= .cse42 .cse43))) (.cse4 (<= .cse13 finddup_~j~1)) (.cse5 (= .cse41 0)) (.cse6 (= .cse37 (select .cse40 .cse32))) (.cse0 (= |#memory_int| |old(#memory_int)|)) (.cse7 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse1 (= |finddup_#in~n| finddup_~n)) (.cse8 (<= .cse39 finddup_~j~1)) (.cse27 (and .cse10 (<= .cse39 .cse12) .cse11)) (.cse30 (and (<= .cse39 .cse14) .cse15)) (.cse17 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse18 (<= 0 finddup_~i~1)) (.cse19 (= |finddup_#in~a.base| finddup_~a.base)) (.cse20 (<= finddup_~n finddup_~j~1)) (.cse21 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse23 (= |finddup_#in~_i.offset| finddup_~_i.offset)) (.cse24 (<= .cse38 finddup_~n)) (.cse16 (= finddup_~a.offset |finddup_#in~a.offset|))) (or (and (<= finddup_~i~1 0) .cse0 .cse1 (<= finddup_~n 1)) (and .cse2 (<= finddup_~j~1 2) .cse0 .cse1 (not (= (select .cse3 (+ |finddup_#in~a.offset| 4)) (select .cse3 |finddup_#in~a.offset|))) (<= finddup_~n 2) .cse4) (and .cse5 .cse6 .cse0 .cse7 .cse1 .cse8 .cse9 (or (and .cse10 .cse11 (<= .cse12 .cse13)) (and (<= .cse14 .cse13) .cse15)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse0 .cse7 .cse1 .cse8 .cse17 .cse18 .cse26 .cse21 .cse23 .cse24) (and .cse0 (or .cse27 (and (<= (+ .cse12 4) finddup_~n) .cse10 .cse11 (not (= .cse28 .cse29))) .cse30 (and (<= (+ .cse14 4) finddup_~n) (not (= .cse28 .cse31)) .cse15)) .cse7 .cse1 .cse8 .cse9 .cse16 .cse17 .cse18 .cse19 (or (and (<= .cse12 finddup_~i~1) .cse10 .cse11) (and .cse15 (<= .cse14 finddup_~i~1))) .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse2 .cse25 .cse0 .cse7 .cse1 (<= 1 finddup_~i~1) .cse17 .cse26 .cse4 .cse21 .cse23) (and (let ((.cse35 (<= finddup_~j~1 .cse38))) (or (and .cse5 .cse6 .cse0 .cse7 (or (and (= .cse32 .cse31) (= .cse29 .cse33)) .cse34 (and (= .cse29 .cse32) .cse11)) .cse1 .cse8 .cse17 .cse18 .cse19 .cse35 .cse20 .cse21 .cse23 .cse24) (and .cse0 .cse7 .cse34 .cse1 .cse8 (let ((.cse36 (+ finddup_~i~1 finddup_~n))) (or .cse27 .cse30 (and (<= (+ finddup_~j~1 .cse12 1) .cse36) .cse10 .cse11) (and (<= (+ finddup_~j~1 .cse14 1) .cse36) .cse15))) .cse17 .cse18 .cse19 (= .cse37 0) .cse35 .cse20 .cse21 .cse23 .cse24))) .cse16)))))))) [2022-02-15 02:22:47,988 INFO L854 garLoopResultBuilder]: At program point L36-3(lines 36 44) the Hoare annotation is: (let ((.cse19 (select |#memory_int| finddup_~a.base)) (.cse23 ((as const (Array Int Int)) 0))) (let ((.cse30 (@diff .cse19 .cse23))) (let ((.cse33 (store .cse19 .cse30 0))) (let ((.cse21 (* finddup_~i~1 4)) (.cse31 (* finddup_~a.offset 3)) (.cse29 (@diff .cse33 .cse23)) (.cse32 (* (- 1) finddup_~a.offset))) (let ((.cse26 (select |old(#memory_int)| |finddup_#in~a.base|)) (.cse16 (not (= .cse23 .cse19))) (.cse13 (div (+ .cse29 .cse32) 4)) (.cse8 (= (mod (+ .cse29 .cse31) 4) 0)) (.cse11 (not (= .cse23 .cse33))) (.cse18 (+ finddup_~i~1 2)) (.cse15 (div (+ .cse32 .cse30) 4)) (.cse20 (+ finddup_~a.offset .cse21)) (.cse17 (= (mod (+ .cse31 .cse30) 4) 0)) (.cse28 (<= 1 finddup_~i~1)) (.cse12 (<= finddup_~n finddup_~j~1)) (.cse0 (= |#memory_int| |old(#memory_int)|)) (.cse1 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse7 (= |finddup_#in~n| finddup_~n)) (.cse2 (= finddup_~a.offset |finddup_#in~a.offset|)) (.cse3 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse4 (= |finddup_#in~a.base| finddup_~a.base)) (.cse5 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse22 (= |finddup_#in~_i.offset| finddup_~_i.offset))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (let ((.cse6 (= (select .cse19 .cse20) (select .cse19 (+ finddup_~a.offset .cse21 4)))) (.cse14 (+ finddup_~i~1 1)) (.cse9 (<= .cse18 finddup_~n)) (.cse10 (<= finddup_~j~1 .cse18))) (or (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse13 .cse14)) (and .cse6 (<= .cse15 .cse14) .cse7 .cse9 .cse16 .cse17 .cse10 .cse12))) .cse22) (and .cse0 .cse7 (<= finddup_~n 1)) (let ((.cse27 (@diff .cse26 .cse23))) (let ((.cse24 (store .cse26 .cse27 0))) (and (let ((.cse25 (@diff .cse24 .cse23))) (or (not (= .cse23 (store .cse24 .cse25 0))) (not (= (select .cse26 .cse25) (select .cse26 .cse27))))) .cse0 .cse1 .cse7 .cse28 (<= 1 finddup_~j~1) .cse3 (not (= .cse24 .cse23)) .cse5 .cse22))) (and (<= finddup_~j~1 2) .cse0 .cse7 (not (= (select .cse26 (+ |finddup_#in~a.offset| 4)) (select .cse26 |finddup_#in~a.offset|))) (<= finddup_~n 2)) (and (or (and .cse16 .cse17 (<= .cse15 finddup_~i~1)) (and (<= .cse13 finddup_~i~1) .cse8 .cse11)) .cse0 (or (and .cse8 (<= .cse18 .cse13) .cse11) (and (<= (+ .cse13 4) finddup_~n) .cse8 .cse11 (not (= .cse20 .cse29))) (and (<= .cse18 .cse15) .cse17) (and (<= (+ .cse15 4) finddup_~n) (not (= .cse20 .cse30)) .cse17)) .cse1 .cse7 .cse28 .cse2 .cse3 .cse4 .cse12 .cse5 .cse22 (<= (+ finddup_~i~1 3) finddup_~n)) (and .cse0 .cse1 .cse7 (= finddup_~i~1 0) .cse2 .cse3 .cse4 .cse5 .cse22))))))) [2022-02-15 02:22:47,988 INFO L854 garLoopResultBuilder]: At program point L36-4(lines 36 44) the Hoare annotation is: (let ((.cse0 (= |#memory_int| |old(#memory_int)|)) (.cse1 (= |finddup_#in~n| finddup_~n)) (.cse5 (select |old(#memory_int)| |finddup_#in~a.base|))) (or (and .cse0 .cse1 (<= finddup_~n 1)) (let ((.cse2 ((as const (Array Int Int)) 0))) (let ((.cse6 (@diff .cse5 .cse2))) (let ((.cse3 (store .cse5 .cse6 0))) (and (let ((.cse4 (@diff .cse3 .cse2))) (or (not (= .cse2 (store .cse3 .cse4 0))) (not (= (select .cse5 .cse4) (select .cse5 .cse6))))) .cse0 (= |finddup_#in~_j.base| finddup_~_j.base) .cse1 (<= 1 finddup_~i~1) (<= 1 finddup_~j~1) (= finddup_~_j.offset |finddup_#in~_j.offset|) (not (= .cse3 .cse2)) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))))) (and (<= finddup_~j~1 2) .cse0 .cse1 (not (= (select .cse5 (+ |finddup_#in~a.offset| 4)) (select .cse5 |finddup_#in~a.offset|))) (<= finddup_~n 2)))) [2022-02-15 02:22:47,988 INFO L854 garLoopResultBuilder]: At program point finddupFINAL(lines 33 46) the Hoare annotation is: (let ((.cse32 (select |old(#memory_int)| |finddup_#in~a.base|)) (.cse27 ((as const (Array Int Int)) 0))) (let ((.cse33 (@diff .cse32 .cse27)) (.cse22 (= |finddup_#in~_i.base| |finddup_#in~_j.base|)) (.cse34 (= finddup_~_i.base finddup_~_j.base))) (let ((.cse17 (= finddup_~i~1 0)) (.cse9 (or .cse34 (= |finddup_#in~_i.base| finddup_~_i.base))) (.cse0 (<= 1 |finddup_#res|)) (.cse11 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse1 (= |finddup_#in~n| finddup_~n)) (.cse12 (<= 1 finddup_~i~1)) (.cse13 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse24 (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|)) (.cse4 (<= (+ finddup_~i~1 1) finddup_~j~1)) (.cse5 (<= |finddup_#res| 1)) (.cse15 (= |finddup_#in~_i.offset| finddup_~_i.offset)) (.cse16 (or .cse22 (not .cse34))) (.cse25 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|)) (.cse26 (store .cse32 .cse33 0))) (let ((.cse2 (not (= (select .cse32 (+ |finddup_#in~a.offset| 4)) (select .cse32 |finddup_#in~a.offset|)))) (.cse3 (<= finddup_~n 2)) (.cse7 (= |#memory_int| |old(#memory_int)|)) (.cse19 (= finddup_~a.offset |finddup_#in~a.offset|)) (.cse21 (= |finddup_#in~a.base| finddup_~a.base)) (.cse10 (let ((.cse31 (@diff .cse26 .cse27))) (or (not (= .cse27 (store .cse26 .cse31 0))) (not (= (select .cse32 .cse31) (select .cse32 .cse33)))))) (.cse20 (let ((.cse28 (<= (+ .cse25 1) |finddup_#in~n|)) (.cse29 (<= 1 .cse25)) (.cse30 (<= (+ finddup_~j~1 1) finddup_~n))) (or (and .cse9 .cse0 .cse11 (or .cse22 (= .cse24 0)) .cse1 .cse17 .cse28 .cse29 .cse13 .cse4 .cse5 .cse30 .cse15 .cse16) (and (or .cse22 (<= (+ .cse24 2) |finddup_#in~n|)) .cse9 .cse0 .cse11 .cse1 .cse28 .cse12 .cse29 .cse13 (or .cse22 (<= 1 .cse24)) .cse4 .cse5 .cse30 .cse15 .cse16)))) (.cse14 (not (= .cse26 .cse27))) (.cse8 (<= finddup_~n 1)) (.cse6 (<= finddup_~j~1 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse8) (and (<= finddup_~j~1 2) .cse7 .cse1 .cse2 .cse3) (and .cse9 .cse10 .cse7 .cse11 .cse1 .cse12 (<= 1 finddup_~j~1) .cse13 .cse14 .cse15 .cse16) (let ((.cse18 (= finddup_~a.offset 0))) (and (not (= |finddup_#in~a.offset| 0)) .cse17 (or .cse18 .cse19) .cse20 (or (not .cse18) .cse21))) (and (or .cse22 (= |finddup_#in~_j.base| |finddup_#in~a.base|) (= |finddup_#in~_i.base| |finddup_#in~a.base|) (let ((.cse23 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse23 (+ |finddup_#in~a.offset| (* .cse24 4))) (select .cse23 (+ |finddup_#in~a.offset| (* .cse25 4)))))) .cse20 .cse19 .cse21 (or (<= (+ .cse24 1) .cse25) .cse22)) (and .cse10 .cse20 .cse14) (and (<= finddup_~i~1 0) .cse0 .cse1 .cse8 .cse5 .cse6)))))) [2022-02-15 02:22:47,988 INFO L854 garLoopResultBuilder]: At program point L37-2(lines 37 43) the Hoare annotation is: (let ((.cse1 (select |#memory_int| finddup_~a.base)) (.cse10 ((as const (Array Int Int)) 0))) (let ((.cse9 (@diff .cse1 .cse10)) (.cse2 (* finddup_~i~1 4))) (let ((.cse51 (+ finddup_~a.offset .cse2)) (.cse45 (store .cse1 .cse9 0))) (let ((.cse7 (@diff .cse45 .cse10)) (.cse53 (* (- 1) finddup_~a.offset)) (.cse52 (* finddup_~a.offset 3)) (.cse14 (select .cse1 .cse51)) (.cse49 (select |old(#memory_int)| |finddup_#in~a.base|))) (let ((.cse50 (@diff .cse49 .cse10)) (.cse24 (= .cse14 0)) (.cse11 (= (mod (+ .cse52 .cse9) 4) 0)) (.cse28 (+ finddup_~i~1 2)) (.cse23 (div (+ .cse53 .cse9) 4)) (.cse18 (div (+ .cse7 .cse53) 4)) (.cse20 (= (mod (+ .cse7 .cse52) 4) 0)) (.cse8 (not (= .cse10 .cse45)))) (let ((.cse13 (and (<= .cse18 finddup_~i~1) .cse20 .cse8)) (.cse12 (<= .cse23 finddup_~i~1)) (.cse44 (+ finddup_~i~1 1)) (.cse16 (and .cse20 (<= .cse28 .cse18) .cse8)) (.cse21 (not (= .cse51 .cse7))) (.cse17 (and (<= .cse28 .cse23) .cse11)) (.cse22 (not (= .cse51 .cse9))) (.cse15 (select .cse1 (+ finddup_~a.offset (* finddup_~j~1 4)))) (.cse6 (not .cse24)) (.cse41 (<= 1 finddup_~i~1)) (.cse31 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse32 (= |finddup_#in~n| finddup_~n)) (.cse26 (= finddup_~a.offset |finddup_#in~a.offset|)) (.cse35 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse27 (= |finddup_#in~a.base| finddup_~a.base)) (.cse43 (<= (+ finddup_~j~1 1) finddup_~n)) (.cse38 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse39 (= |finddup_#in~_i.offset| finddup_~_i.offset)) (.cse46 (store .cse49 .cse50 0))) (let ((.cse33 (not (= (select .cse49 (+ |finddup_#in~a.offset| 4)) (select .cse49 |finddup_#in~a.offset|)))) (.cse40 (let ((.cse48 (@diff .cse46 .cse10))) (or (not (= .cse10 (store .cse46 .cse48 0))) (not (= (select .cse49 .cse48) (select .cse49 .cse50)))))) (.cse5 (let ((.cse47 (<= .cse28 finddup_~j~1))) (or (and .cse31 .cse32 .cse47 .cse41 .cse35 .cse43 .cse38 .cse39) (and .cse31 .cse32 .cse47 .cse26 .cse35 (<= 0 finddup_~i~1) .cse27 .cse43 .cse38 .cse39)))) (.cse42 (not (= .cse46 .cse10))) (.cse37 (<= finddup_~j~1 1)) (.cse0 (or (not (= .cse15 0)) .cse6)) (.cse4 (= |#memory_int| |old(#memory_int)|)) (.cse25 (<= (+ finddup_~j~1 2) finddup_~n)) (.cse29 (or .cse16 (and (<= (+ .cse18 4) finddup_~n) .cse20 .cse8 .cse21) .cse17 (and (<= (+ .cse23 4) finddup_~n) .cse22 .cse11) (not (= .cse10 (store .cse45 .cse7 0))))) (.cse34 (<= finddup_~j~1 .cse44)) (.cse36 (<= .cse44 finddup_~j~1)) (.cse30 (or .cse13 (and .cse11 .cse12)))) (or (let ((.cse3 (+ finddup_~a.offset .cse2 4))) (and .cse0 (= (select .cse1 (+ finddup_~a.offset .cse2 8)) (select .cse1 .cse3)) .cse4 (= finddup_~i~1 0) .cse5 (or .cse6 (and (= .cse7 .cse3) .cse8) (= .cse3 .cse9)))) (and (or (and (not (= .cse10 .cse1)) .cse11 .cse12) .cse13) (or (and (not (= .cse14 .cse15)) (let ((.cse19 (+ finddup_~i~1 finddup_~n))) (or .cse16 .cse17 (and (<= (+ finddup_~j~1 2 .cse18) .cse19) .cse20 .cse8 .cse21) (and .cse22 .cse11 (<= (+ finddup_~j~1 2 .cse23) .cse19))))) .cse24) .cse4 .cse5 (or .cse6 .cse25) .cse26 .cse27 (<= finddup_~j~1 .cse28)) (and .cse0 .cse4 .cse29 .cse5 .cse26 .cse27 (<= (+ finddup_~i~1 3) finddup_~j~1) .cse30) (and .cse4 .cse31 .cse32 .cse33 (<= 1 finddup_~j~1) .cse34 .cse26 .cse35 .cse27 .cse36 .cse37 .cse38 .cse39) (and .cse40 .cse4 .cse31 .cse32 .cse41 .cse35 .cse42 .cse36 .cse43 .cse38 .cse39) (and .cse4 .cse32 .cse33 (<= finddup_~n 2) .cse36 .cse37) (and .cse40 .cse4 .cse5 .cse42) (and (<= finddup_~i~1 0) .cse4 .cse32 (<= finddup_~n 1) .cse37) (and .cse0 .cse4 .cse31 .cse32 .cse25 .cse29 .cse41 .cse34 .cse26 .cse35 .cse27 .cse36 .cse30 .cse38 .cse39))))))))) [2022-02-15 02:22:47,988 INFO L854 garLoopResultBuilder]: At program point L37-3(lines 37 43) the Hoare annotation is: (let ((.cse50 (select |#memory_int| finddup_~a.base)) (.cse61 ((as const (Array Int Int)) 0))) (let ((.cse48 (@diff .cse50 .cse61))) (let ((.cse68 (store .cse50 .cse48 0)) (.cse67 (* finddup_~i~1 4))) (let ((.cse69 (+ finddup_~a.offset .cse67)) (.cse47 (@diff .cse68 .cse61)) (.cse71 (* finddup_~a.offset 3)) (.cse70 (* (- 1) finddup_~a.offset))) (let ((.cse54 (select |old(#memory_int)| |finddup_#in~a.base|)) (.cse16 (div (+ .cse70 .cse48) 4)) (.cse2 (= (mod (+ .cse71 .cse48) 4) 0)) (.cse13 (= (mod (+ .cse47 .cse71) 4) 0)) (.cse53 (+ finddup_~i~1 2)) (.cse11 (div (+ .cse47 .cse70) 4)) (.cse14 (not (= .cse61 .cse68))) (.cse49 (select .cse50 .cse69))) (let ((.cse65 (+ finddup_~a.offset .cse67 8)) (.cse64 (= .cse49 0)) (.cse9 (and .cse13 (<= .cse53 .cse11) .cse14)) (.cse15 (not (= .cse69 .cse47))) (.cse10 (and (<= .cse53 .cse16) .cse2)) (.cse17 (not (= .cse69 .cse48))) (.cse56 (not (= .cse61 (store .cse68 .cse47 0)))) (.cse63 (@diff .cse54 .cse61))) (let ((.cse44 (<= 1 finddup_~i~1)) (.cse24 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse23 (= |finddup_#in~n| finddup_~n)) (.cse38 (= finddup_~i~1 0)) (.cse43 (<= .cse53 finddup_~j~1)) (.cse18 (= finddup_~a.offset |finddup_#in~a.offset|)) (.cse28 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse32 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse33 (= |finddup_#in~_i.offset| finddup_~_i.offset)) (.cse60 (store .cse54 .cse63 0)) (.cse51 (+ finddup_~j~1 1)) (.cse59 (+ finddup_~i~1 1)) (.cse1 (not (= .cse61 .cse50))) (.cse3 (<= .cse16 finddup_~i~1)) (.cse57 (<= .cse11 finddup_~i~1)) (.cse22 (= |#memory_int| |old(#memory_int)|)) (.cse52 (or .cse9 (and (<= (+ .cse11 4) finddup_~n) .cse13 .cse14 .cse15) .cse10 (and (<= (+ .cse16 4) finddup_~n) .cse17 .cse2) .cse56)) (.cse19 (= |finddup_#in~a.base| finddup_~a.base)) (.cse55 (+ finddup_~i~1 3)) (.cse5 (not .cse64)) (.cse7 (select .cse50 .cse65)) (.cse66 (+ finddup_~a.offset .cse67 4)) (.cse8 (not (= .cse49 (select .cse50 .cse48))))) (let ((.cse36 (or (= .cse7 (select .cse50 .cse66)) (not (= (select .cse50 .cse47) .cse49)) .cse8 .cse56)) (.cse37 (or (and (= .cse65 .cse48) (= .cse47 .cse66) .cse14) .cse5 (and .cse14 (= .cse66 .cse48) (= .cse47 .cse65)) .cse56)) (.cse20 (<= finddup_~j~1 .cse55)) (.cse30 (or .cse64 (and .cse22 .cse52 .cse19))) (.cse25 (<= (+ finddup_~j~1 2) finddup_~n)) (.cse31 (or .cse5 (and (or (and .cse1 .cse2 .cse3 (<= (+ 3 .cse16) finddup_~n)) .cse56 (and (<= (+ 3 .cse11) finddup_~n) .cse57 .cse13 .cse14)) .cse22 .cse19))) (.cse26 (<= 1 finddup_~j~1)) (.cse46 (+ finddup_~a.offset (* finddup_~j~1 4))) (.cse27 (<= finddup_~j~1 .cse59)) (.cse6 (<= .cse51 finddup_~n)) (.cse34 (<= .cse59 finddup_~n)) (.cse41 (let ((.cse62 (@diff .cse60 .cse61))) (or (not (= .cse61 (store .cse60 .cse62 0))) (not (= (select .cse54 .cse62) (select .cse54 .cse63)))))) (.cse42 (not (= .cse60 .cse61))) (.cse29 (<= .cse59 finddup_~j~1)) (.cse0 (let ((.cse58 (<= .cse55 finddup_~n))) (or (and .cse22 .cse24 .cse23 .cse43 .cse44 .cse28 .cse32 .cse33 .cse58) (and .cse22 .cse24 .cse23 .cse38 .cse43 .cse18 .cse28 .cse19 .cse32 .cse33 .cse58)))) (.cse39 (<= (+ finddup_~i~1 4) finddup_~n)) (.cse21 (<= .cse55 finddup_~j~1)) (.cse4 (and .cse57 .cse13 .cse14)) (.cse40 (or (and (<= .cse55 .cse16) .cse2) (and .cse13 .cse14 (<= .cse55 .cse11)) .cse5 .cse56)) (.cse35 (not (= (select .cse54 (+ |finddup_#in~a.offset| 4)) (select .cse54 |finddup_#in~a.offset|)))) (.cse45 (<= finddup_~j~1 .cse53))) (or (and .cse0 (or (and .cse1 .cse2 .cse3) .cse4) (or .cse5 .cse6) (or (= .cse7 0) .cse8) (let ((.cse12 (+ finddup_~i~1 finddup_~n))) (or .cse9 .cse10 (and (<= (+ finddup_~j~1 .cse11 1) .cse12) .cse13 .cse14 .cse15) (and (<= (+ finddup_~j~1 .cse16 1) .cse12) .cse17 .cse2))) .cse18 .cse19 .cse20 .cse21) (and (<= finddup_~i~1 0) .cse22 .cse23 (<= finddup_~n 1)) (and .cse24 .cse23 .cse25 .cse26 .cse27 .cse18 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) (and .cse34 (<= finddup_~j~1 2) .cse22 .cse23 .cse35 (<= finddup_~n 2) .cse29) (and .cse36 .cse0 .cse37 .cse38 .cse39 .cse40) (and .cse0 .cse41 .cse42) (and .cse36 .cse0 .cse37 .cse38 .cse20) (and .cse24 .cse23 .cse43 .cse44 .cse18 .cse28 .cse45 .cse30 (or .cse5 .cse25 (and (not (= .cse46 .cse47)) (not (= .cse46 .cse48)) .cse14)) .cse6 .cse31 .cse32 .cse33) (and .cse22 .cse24 .cse23 .cse26 .cse27 .cse18 .cse28 .cse19 .cse29 (<= finddup_~j~1 1) .cse32 .cse33) (and (= .cse49 (select .cse50 .cse46)) .cse22 .cse24 (<= finddup_~n .cse51) .cse23 .cse27 .cse18 .cse28 .cse19 .cse29 .cse6 .cse32 .cse33) (and .cse34 .cse41 .cse22 .cse24 .cse23 .cse44 .cse28 .cse42 .cse29 .cse32 .cse33) (and .cse0 .cse52 .cse39 .cse18 .cse19 .cse21 (or .cse4 (and .cse2 .cse3)) .cse40) (and .cse22 .cse24 .cse23 .cse38 .cse35 (<= 2 finddup_~j~1) .cse18 .cse28 .cse19 .cse45 .cse32 .cse33)))))))))) [2022-02-15 02:22:47,988 INFO L854 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-02-15 02:22:47,989 INFO L854 garLoopResultBuilder]: At program point L16-2(lines 15 17) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-02-15 02:22:47,989 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 15 17) the Hoare annotation is: true [2022-02-15 02:22:47,989 INFO L854 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 15 17) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-02-15 02:22:47,989 INFO L854 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= |main_#t~malloc13.offset| 0) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_~#j~2.base|)) (<= 2 main_~n~0) (not (= |main_#t~mem22| |main_#t~mem21|)) (<= (+ 1 .cse0) .cse1) (let ((.cse2 (select |#memory_int| main_~a~0.base))) (= (select .cse2 (* 4 .cse0)) (select .cse2 (* .cse1 4)))) (not (= |main_~#i~2.base| main_~a~0.base)) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|) (not (= |main_~#i~2.base| |main_~#j~2.base|)))) [2022-02-15 02:22:47,989 INFO L854 garLoopResultBuilder]: At program point L62-1(line 62) the Hoare annotation is: (and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= |main_#t~malloc13.offset| 0) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_~#j~2.base|)) (<= 2 main_~n~0) (not (= |main_#t~mem22| |main_#t~mem21|)) (let ((.cse0 (select |#memory_int| main_~a~0.base))) (= (select .cse0 (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select .cse0 (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4)))) (not (= |main_~#i~2.base| main_~a~0.base)) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|) (not (= |main_~#i~2.base| |main_~#j~2.base|))) [2022-02-15 02:22:47,989 INFO L854 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (not (= main_~a~0.base |main_~#j~2.base|)) (<= (+ 1 .cse0) .cse1) (let ((.cse2 (select |#memory_int| main_~a~0.base))) (= (select .cse2 (* 4 .cse0)) (select .cse2 (* .cse1 4)))) (let ((.cse3 (= |main_#t~malloc13.offset| 0)) (.cse4 (<= (+ .cse1 1) main_~n~0)) (.cse5 (= main_~a~0.offset 0))) (or (and .cse3 .cse4 .cse5 (= 0 .cse0) |main_#t~short17|) (and .cse3 (<= 1 .cse0) .cse4 .cse5 |main_#t~short17|))) (not (= |main_~#i~2.base| main_~a~0.base)) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|) (not (= |main_~#i~2.base| |main_~#j~2.base|)))) [2022-02-15 02:22:47,989 INFO L854 garLoopResultBuilder]: At program point L60-2(line 60) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse0 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= |main_#t~malloc13.offset| 0) (<= (+ .cse0 1) main_~n~0) (<= 1 .cse0) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_~#j~2.base|)) (<= (+ 1 .cse1) .cse0) (let ((.cse2 (select |#memory_int| main_~a~0.base))) (= (select .cse2 (* 4 .cse1)) (select .cse2 (* .cse0 4)))) (not (= |main_~#i~2.base| main_~a~0.base)) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|) (not (= |main_~#i~2.base| |main_~#j~2.base|)) |main_#t~short17|)) [2022-02-15 02:22:47,989 INFO L854 garLoopResultBuilder]: At program point L60-3(line 60) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse0 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= |main_#t~malloc13.offset| 0) (<= (+ .cse0 1) main_~n~0) (<= 1 .cse0) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_~#j~2.base|)) (<= (+ 1 .cse1) .cse0) (let ((.cse2 (select |#memory_int| main_~a~0.base))) (= (select .cse2 (* 4 .cse1)) (select .cse2 (* .cse0 4)))) (not (= |main_~#i~2.base| main_~a~0.base)) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|) (not (= |main_~#i~2.base| |main_~#j~2.base|)) |main_#t~short17|)) [2022-02-15 02:22:47,989 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 48 66) the Hoare annotation is: true [2022-02-15 02:22:47,989 INFO L854 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= |main_#t~malloc13.offset| 0) (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc13.base|)) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|))) [2022-02-15 02:22:47,989 INFO L854 garLoopResultBuilder]: At program point L54-1(line 54) the Hoare annotation is: (let ((.cse2 (select |#memory_int| main_~a~0.base)) (.cse1 ((as const (Array Int Int)) 0))) (let ((.cse3 (@diff .cse2 .cse1))) (let ((.cse0 (store .cse2 .cse3 0))) (let ((.cse4 (@diff .cse0 .cse1)) (.cse5 (* main_~n~0 4))) (and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= |main_#t~malloc13.offset| 0) (or (= .cse0 .cse1) (= (select .cse2 .cse3) (select .cse2 .cse4))) (= main_~a~0.offset 0) (= .cse1 (store .cse0 .cse4 0)) (<= 8 .cse5) (or (= (select .cse2 (+ .cse5 (- 4))) (select .cse2 (+ .cse5 (- 8)))) (< 8 .cse5)) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|)))))) [2022-02-15 02:22:47,989 INFO L854 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (= |main_#t~malloc13.offset| 0) (= |#memory_int| |old(#memory_int)|) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|)) [2022-02-15 02:22:47,989 INFO L854 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (and (= |main_#t~malloc13.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc13.base|)) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|)) [2022-02-15 02:22:47,990 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 48 66) the Hoare annotation is: true [2022-02-15 02:22:47,990 INFO L854 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= |main_#t~malloc13.offset| 0) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_~#j~2.base|)) (<= 2 main_~n~0) (= |main_#t~mem26| |main_#t~mem25|) (let ((.cse0 (select |#memory_int| main_~a~0.base))) (= (select .cse0 (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select .cse0 (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4)))) (not (= |main_~#i~2.base| main_~a~0.base)) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|) (not (= |main_~#i~2.base| |main_~#j~2.base|))) [2022-02-15 02:22:47,990 INFO L861 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: true [2022-02-15 02:22:47,990 INFO L854 garLoopResultBuilder]: At program point mainENTRY(lines 48 66) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-02-15 02:22:47,990 INFO L854 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse0 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= |main_#t~malloc13.offset| 0) (<= (+ .cse0 1) main_~n~0) (<= 1 .cse0) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_~#j~2.base|)) (<= (+ 1 .cse1) .cse0) (let ((.cse2 (select |#memory_int| main_~a~0.base))) (= (select .cse2 (* 4 .cse1)) (select .cse2 (* .cse0 4)))) (not (= |main_~#i~2.base| main_~a~0.base)) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|) (not (= |main_~#i~2.base| |main_~#j~2.base|)) |main_#t~short20|)) [2022-02-15 02:22:47,990 INFO L854 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= |main_#t~malloc13.offset| 0) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_~#j~2.base|)) (<= (+ 1 .cse0) .cse1) (let ((.cse2 (select |#memory_int| main_~a~0.base))) (= (select .cse2 (* 4 .cse0)) (select .cse2 (* .cse1 4)))) (not (= |main_~#i~2.base| main_~a~0.base)) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|) (not (= |main_~#i~2.base| |main_~#j~2.base|)) (let ((.cse3 (<= (+ .cse1 1) main_~n~0)) (.cse4 (= main_~r~0 1))) (or (and .cse3 (= 0 .cse0) .cse4) (and (<= 1 .cse0) .cse3 .cse4))))) [2022-02-15 02:22:47,990 INFO L854 garLoopResultBuilder]: At program point L61-2(line 61) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse0 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= |main_#t~malloc13.offset| 0) (<= (+ .cse0 1) main_~n~0) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_~#j~2.base|)) (<= 2 main_~n~0) (<= (+ 1 .cse1) .cse0) (let ((.cse2 (select |#memory_int| main_~a~0.base))) (= (select .cse2 (* 4 .cse1)) (select .cse2 (* .cse0 4)))) (not (= |main_~#i~2.base| main_~a~0.base)) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|) (not (= |main_~#i~2.base| |main_~#j~2.base|)) |main_#t~short20|)) [2022-02-15 02:22:47,990 INFO L854 garLoopResultBuilder]: At program point L59-1(line 59) the Hoare annotation is: (let ((.cse3 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse5 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (and (let ((.cse0 (= |main_#t~malloc13.offset| 0)) (.cse1 (<= (+ .cse5 1) main_~n~0)) (.cse2 (= main_~a~0.offset 0)) (.cse4 (not (= |main_~#i~2.base| |main_~#j~2.base|)))) (or (and .cse0 .cse1 .cse2 (= 0 .cse3) .cse4) (and .cse0 (<= 1 .cse3) .cse1 .cse2 .cse4))) (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (not (= main_~a~0.base |main_~#j~2.base|)) (<= (+ 1 .cse3) .cse5) (let ((.cse6 (select |#memory_int| main_~a~0.base))) (= (select .cse6 (* 4 .cse3)) (select .cse6 (* .cse5 4)))) (not (= |main_~#i~2.base| main_~a~0.base)) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|))) [2022-02-15 02:22:47,990 INFO L854 garLoopResultBuilder]: At program point L61-3(line 61) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= |main_#t~malloc13.offset| 0) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_~#j~2.base|)) (<= 2 main_~n~0) (<= (+ 1 .cse0) .cse1) (let ((.cse2 (select |#memory_int| main_~a~0.base))) (= (select .cse2 (* 4 .cse0)) (select .cse2 (* .cse1 4)))) (not (= |main_~#i~2.base| main_~a~0.base)) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|) (not (= |main_~#i~2.base| |main_~#j~2.base|)))) [2022-02-15 02:22:47,990 INFO L854 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse2 (select |#memory_int| main_~a~0.base)) (.cse1 ((as const (Array Int Int)) 0))) (let ((.cse3 (@diff .cse2 .cse1))) (let ((.cse0 (store .cse2 .cse3 0))) (let ((.cse4 (@diff .cse0 .cse1)) (.cse5 (* main_~n~0 4))) (and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= |main_#t~malloc13.offset| 0) (or (= .cse0 .cse1) (= (select .cse2 .cse3) (select .cse2 .cse4))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_~#j~2.base|)) (= .cse1 (store .cse0 .cse4 0)) (<= 8 .cse5) (or (= (select .cse2 (+ .cse5 (- 4))) (select .cse2 (+ .cse5 (- 8)))) (< 8 .cse5)) (not (= |main_~#i~2.base| main_~a~0.base)) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|) (not (= |main_~#i~2.base| |main_~#j~2.base|))))))) [2022-02-15 02:22:47,990 INFO L854 garLoopResultBuilder]: At program point L57-1(line 57) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (not (= main_~a~0.base |main_~#j~2.base|)) (<= (+ 1 .cse0) .cse1) (let ((.cse2 (select |#memory_int| main_~a~0.base))) (= (select .cse2 (* 4 .cse0)) (select .cse2 (* .cse1 4)))) (not (= |main_~#i~2.base| main_~a~0.base)) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|) (not (= |main_~#i~2.base| |main_~#j~2.base|)) (let ((.cse3 (= |main_#t~malloc13.offset| 0)) (.cse4 (<= (+ .cse1 1) main_~n~0)) (.cse5 (= main_~a~0.offset 0)) (.cse6 (= |main_#t~ret14| 1))) (or (and .cse3 (<= 1 .cse0) .cse4 .cse5 .cse6) (and .cse3 .cse4 .cse5 (= 0 .cse0) .cse6))))) [2022-02-15 02:22:47,990 INFO L854 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-02-15 02:22:47,990 INFO L854 garLoopResultBuilder]: At program point L51-1(line 51) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-02-15 02:22:47,991 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-02-15 02:22:47,991 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-02-15 02:22:47,991 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-02-15 02:22:47,991 INFO L854 garLoopResultBuilder]: At program point mkdupENTRY(lines 19 31) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-02-15 02:22:47,991 INFO L854 garLoopResultBuilder]: At program point mkdupFINAL(lines 19 31) the Hoare annotation is: (let ((.cse3 (select |old(#memory_int)| |mkdup_#in~a.base|)) (.cse0 (select |#memory_int| |mkdup_#in~a.base|))) (let ((.cse7 (@diff .cse3 .cse0))) (let ((.cse2 (select .cse0 .cse7))) (let ((.cse5 (store .cse3 .cse7 .cse2))) (let ((.cse6 (@diff .cse5 .cse0))) (let ((.cse4 (select .cse0 .cse6))) (and (= |mkdup_#in~n| mkdup_~n) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~j~0) (= mkdup_~a.base |mkdup_#in~a.base|) (<= (+ mkdup_~i~0 1) mkdup_~n) (or (< 8 (* |mkdup_#in~n| 4)) (= (select .cse0 |mkdup_#in~a.offset|) (select .cse0 (+ |mkdup_#in~a.offset| 4)))) (not (= (* mkdup_~j~0 4) (* mkdup_~i~0 4))) (or (not (let ((.cse1 ((as const (Array Int Int)) 0))) (= .cse1 (store .cse0 (@diff .cse0 .cse1) 0)))) (= .cse2 0) (= .cse3 .cse0)) (or (= .cse2 .cse4) (= .cse0 .cse5)) (<= 0 mkdup_~i~0) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|) (= .cse0 (store (store .cse3 .cse6 .cse4) .cse7 .cse2))))))))) [2022-02-15 02:22:47,991 INFO L854 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (and (= |mkdup_#in~n| mkdup_~n) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~j~0) (= mkdup_~a.base |mkdup_#in~a.base|) (<= (+ mkdup_~i~0 1) mkdup_~n) (not (= (* mkdup_~j~0 4) (* mkdup_~i~0 4))) (<= 0 mkdup_~i~0) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|)) [2022-02-15 02:22:47,991 INFO L854 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (and (= |mkdup_#in~n| mkdup_~n) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~j~0) (= mkdup_~a.base |mkdup_#in~a.base|) (<= (+ mkdup_~i~0 1) mkdup_~n) (<= 0 mkdup_~i~0) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|)) [2022-02-15 02:22:47,991 INFO L854 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: (and (= |mkdup_#in~n| mkdup_~n) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|)) [2022-02-15 02:22:47,991 INFO L854 garLoopResultBuilder]: At program point L23-1(line 23) the Hoare annotation is: (and (= |mkdup_#in~n| mkdup_~n) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|) (<= (+ mkdup_~i~0 1) mkdup_~n) (<= 0 mkdup_~i~0)) [2022-02-15 02:22:47,991 INFO L854 garLoopResultBuilder]: At program point mkdupEXIT(lines 19 31) the Hoare annotation is: (let ((.cse3 (select |old(#memory_int)| |mkdup_#in~a.base|)) (.cse0 (select |#memory_int| |mkdup_#in~a.base|))) (let ((.cse7 (@diff .cse3 .cse0))) (let ((.cse2 (select .cse0 .cse7))) (let ((.cse5 (store .cse3 .cse7 .cse2))) (let ((.cse6 (@diff .cse5 .cse0))) (let ((.cse4 (select .cse0 .cse6))) (and (= |mkdup_#in~n| mkdup_~n) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~j~0) (= mkdup_~a.base |mkdup_#in~a.base|) (<= (+ mkdup_~i~0 1) mkdup_~n) (or (< 8 (* |mkdup_#in~n| 4)) (= (select .cse0 |mkdup_#in~a.offset|) (select .cse0 (+ |mkdup_#in~a.offset| 4)))) (not (= (* mkdup_~j~0 4) (* mkdup_~i~0 4))) (or (not (let ((.cse1 ((as const (Array Int Int)) 0))) (= .cse1 (store .cse0 (@diff .cse0 .cse1) 0)))) (= .cse2 0) (= .cse3 .cse0)) (or (= .cse2 .cse4) (= .cse0 .cse5)) (<= 0 mkdup_~i~0) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|) (= .cse0 (store (store .cse3 .cse6 .cse4) .cse7 .cse2))))))))) [2022-02-15 02:22:47,991 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-02-15 02:22:47,991 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-02-15 02:22:47,991 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-02-15 02:22:47,991 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-02-15 02:22:47,992 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 11) the Hoare annotation is: true [2022-02-15 02:22:47,992 INFO L854 garLoopResultBuilder]: At program point L10(line 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| 0)) [2022-02-15 02:22:47,992 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 9 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| 0)) [2022-02-15 02:22:47,992 INFO L854 garLoopResultBuilder]: At program point L10-1(line 10) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-02-15 02:22:47,992 INFO L854 garLoopResultBuilder]: At program point L10-3(lines 9 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| 0)) [2022-02-15 02:22:47,992 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-02-15 02:22:47,992 INFO L854 garLoopResultBuilder]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-02-15 02:22:47,992 INFO L854 garLoopResultBuilder]: At program point #Ultimate.meminitEXIT(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2022-02-15 02:22:47,992 INFO L854 garLoopResultBuilder]: At program point #Ultimate.meminitFINAL(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2022-02-15 02:22:47,994 INFO L732 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:22:47,995 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-15 02:22:48,000 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:259) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:342) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:474) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:193) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-15 02:22:48,004 INFO L158 Benchmark]: Toolchain (without parser) took 53776.93ms. Allocated memory was 177.2MB in the beginning and 685.8MB in the end (delta: 508.6MB). Free memory was 123.4MB in the beginning and 547.0MB in the end (delta: -423.5MB). Peak memory consumption was 393.7MB. Max. memory is 8.0GB. [2022-02-15 02:22:48,004 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 177.2MB. Free memory is still 139.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-15 02:22:48,005 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.63ms. Allocated memory is still 177.2MB. Free memory was 123.1MB in the beginning and 148.3MB in the end (delta: -25.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-02-15 02:22:48,005 INFO L158 Benchmark]: Boogie Preprocessor took 32.97ms. Allocated memory is still 177.2MB. Free memory was 148.3MB in the beginning and 146.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-15 02:22:48,005 INFO L158 Benchmark]: RCFGBuilder took 374.37ms. Allocated memory is still 177.2MB. Free memory was 146.8MB in the beginning and 132.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-02-15 02:22:48,005 INFO L158 Benchmark]: TraceAbstraction took 53166.58ms. Allocated memory was 177.2MB in the beginning and 685.8MB in the end (delta: 508.6MB). Free memory was 131.6MB in the beginning and 547.0MB in the end (delta: -415.4MB). Peak memory consumption was 401.6MB. Max. memory is 8.0GB. [2022-02-15 02:22:48,006 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 177.2MB. Free memory is still 139.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.63ms. Allocated memory is still 177.2MB. Free memory was 123.1MB in the beginning and 148.3MB in the end (delta: -25.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.97ms. Allocated memory is still 177.2MB. Free memory was 148.3MB in the beginning and 146.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 374.37ms. Allocated memory is still 177.2MB. Free memory was 146.8MB in the beginning and 132.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 53166.58ms. Allocated memory was 177.2MB in the beginning and 685.8MB in the end (delta: 508.6MB). Free memory was 131.6MB in the beginning and 547.0MB in the end (delta: -415.4MB). Peak memory consumption was 401.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 10]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.1s, OverallIterations: 20, TraceHistogramMax: 7, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 21.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2104 SdHoareTripleChecker+Valid, 10.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2035 mSDsluCounter, 1202 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 312 mSDsCounter, 1652 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15841 IncrementalHoareTripleChecker+Invalid, 17493 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1652 mSolverCounterUnsat, 890 mSDtfsCounter, 15841 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 934 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 542 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3813 ImplicationChecksByTransitivity, 14.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=17, InterpolantAutomatonStates: 354, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 140 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 59 LocationsWithAnnotation, 642 PreInvPairs, 882 NumberOfFragments, 14034 HoareAnnotationTreeSize, 642 FomulaSimplifications, 3027 FormulaSimplificationTreeSizeReduction, 3.9s HoareSimplificationTime, 59 FomulaSimplificationsInter, 209268 FormulaSimplificationTreeSizeReductionInter, 13.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:259) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-15 02:22:48,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...