/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-d966a43 [2022-01-31 21:47:24,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 21:47:24,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 21:47:24,475 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 21:47:24,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 21:47:24,476 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 21:47:24,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 21:47:24,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 21:47:24,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 21:47:24,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 21:47:24,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 21:47:24,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 21:47:24,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 21:47:24,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 21:47:24,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 21:47:24,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 21:47:24,494 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 21:47:24,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 21:47:24,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 21:47:24,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 21:47:24,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 21:47:24,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 21:47:24,507 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 21:47:24,508 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 21:47:24,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 21:47:24,512 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 21:47:24,512 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 21:47:24,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 21:47:24,513 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 21:47:24,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 21:47:24,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 21:47:24,514 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 21:47:24,514 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 21:47:24,514 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 21:47:24,515 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 21:47:24,515 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 21:47:24,516 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 21:47:24,516 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 21:47:24,516 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 21:47:24,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 21:47:24,517 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 21:47:24,523 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-01-31 21:47:24,532 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 21:47:24,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 21:47:24,533 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 21:47:24,533 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 21:47:24,533 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 21:47:24,533 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 21:47:24,533 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 21:47:24,533 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 21:47:24,533 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 21:47:24,534 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 21:47:24,534 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 21:47:24,534 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 21:47:24,535 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 21:47:24,535 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 21:47:24,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 21:47:24,535 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 21:47:24,535 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 21:47:24,535 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 21:47:24,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:47:24,535 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 21:47:24,535 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 21:47:24,535 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 21:47:24,535 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 21:47:24,535 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-01-31 21:47:24,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 21:47:24,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 21:47:24,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 21:47:24,746 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 21:47:24,747 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 21:47:24,747 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/duplets.c [2022-01-31 21:47:24,788 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/677949b4d/947bf521c44e420299abe450be314429/FLAGe0dc756fd [2022-01-31 21:47:25,147 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 21:47:25,147 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c [2022-01-31 21:47:25,151 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/677949b4d/947bf521c44e420299abe450be314429/FLAGe0dc756fd [2022-01-31 21:47:25,162 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/677949b4d/947bf521c44e420299abe450be314429 [2022-01-31 21:47:25,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 21:47:25,165 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 21:47:25,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 21:47:25,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 21:47:25,169 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 21:47:25,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:47:25" (1/1) ... [2022-01-31 21:47:25,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e9718b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:25, skipping insertion in model container [2022-01-31 21:47:25,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:47:25" (1/1) ... [2022-01-31 21:47:25,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 21:47:25,183 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 21:47:25,271 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-01-31 21:47:25,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:47:25,342 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 21:47:25,348 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-01-31 21:47:25,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:47:25,377 INFO L208 MainTranslator]: Completed translation [2022-01-31 21:47:25,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:25 WrapperNode [2022-01-31 21:47:25,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 21:47:25,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 21:47:25,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 21:47:25,379 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 21:47:25,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:25" (1/1) ... [2022-01-31 21:47:25,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:25" (1/1) ... [2022-01-31 21:47:25,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:25" (1/1) ... [2022-01-31 21:47:25,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:25" (1/1) ... [2022-01-31 21:47:25,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:25" (1/1) ... [2022-01-31 21:47:25,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:25" (1/1) ... [2022-01-31 21:47:25,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:25" (1/1) ... [2022-01-31 21:47:25,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 21:47:25,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 21:47:25,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 21:47:25,416 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 21:47:25,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:25" (1/1) ... [2022-01-31 21:47:25,423 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:47:25,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 21:47:25,440 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 21:47:25,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 21:47:25,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 21:47:25,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 21:47:25,499 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 21:47:25,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 21:47:25,499 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 21:47:25,499 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2022-01-31 21:47:25,500 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2022-01-31 21:47:25,500 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 21:47:25,500 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-01-31 21:47:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-01-31 21:47:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-01-31 21:47:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 21:47:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 21:47:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 21:47:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 21:47:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 21:47:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 21:47:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 21:47:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2022-01-31 21:47:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 21:47:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2022-01-31 21:47:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 21:47:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 21:47:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 21:47:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 21:47:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-01-31 21:47:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 21:47:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 21:47:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 21:47:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 21:47:25,595 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 21:47:25,608 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 21:47:25,794 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 21:47:25,799 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 21:47:25,799 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-31 21:47:25,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:47:25 BoogieIcfgContainer [2022-01-31 21:47:25,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 21:47:25,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 21:47:25,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 21:47:25,804 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 21:47:25,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:47:25" (1/3) ... [2022-01-31 21:47:25,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5973d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:47:25, skipping insertion in model container [2022-01-31 21:47:25,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:25" (2/3) ... [2022-01-31 21:47:25,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5973d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:47:25, skipping insertion in model container [2022-01-31 21:47:25,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:47:25" (3/3) ... [2022-01-31 21:47:25,805 INFO L111 eAbstractionObserver]: Analyzing ICFG duplets.c [2022-01-31 21:47:25,808 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 21:47:25,809 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 21:47:25,836 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 21:47:25,846 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-01-31 21:47:25,846 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 21:47:25,861 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-01-31 21:47:25,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 21:47:25,870 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:25,871 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-01-31 21:47:25,871 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:25,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:25,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1531213237, now seen corresponding path program 1 times [2022-01-31 21:47:25,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:25,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [898316570] [2022-01-31 21:47:25,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:25,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:25,939 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:26,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:47:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:26,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:26,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:47:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:26,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:47:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:26,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:47:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:26,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:26,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:47:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:26,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 21:47:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-31 21:47:26,161 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:47:26,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [898316570] [2022-01-31 21:47:26,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [898316570] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:47:26,163 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:47:26,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 21:47:26,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511098900] [2022-01-31 21:47:26,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:47:26,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 21:47:26,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:47:26,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 21:47:26,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 21:47:26,190 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-01-31 21:47:26,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:47:26,356 INFO L93 Difference]: Finished difference Result 113 states and 153 transitions. [2022-01-31 21:47:26,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 21:47:26,358 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-01-31 21:47:26,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:47:26,367 INFO L225 Difference]: With dead ends: 113 [2022-01-31 21:47:26,368 INFO L226 Difference]: Without dead ends: 56 [2022-01-31 21:47:26,371 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-01-31 21:47:26,373 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-01-31 21:47:26,375 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-01-31 21:47:26,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-01-31 21:47:26,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2022-01-31 21:47:26,410 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-01-31 21:47:26,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-01-31 21:47:26,416 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 49 [2022-01-31 21:47:26,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:47:26,416 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-01-31 21:47:26,417 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-01-31 21:47:26,417 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-01-31 21:47:26,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 21:47:26,420 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:26,420 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-01-31 21:47:26,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 21:47:26,421 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:26,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:26,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1121655349, now seen corresponding path program 1 times [2022-01-31 21:47:26,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:26,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1011653752] [2022-01-31 21:47:26,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:26,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:26,428 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:26,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:47:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:26,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:26,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:47:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:26,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:47:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:26,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:47:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:26,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:26,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:47:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:26,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 21:47:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 21:47:26,704 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:47:26,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1011653752] [2022-01-31 21:47:26,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1011653752] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:47:26,705 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:47:26,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:47:26,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461246708] [2022-01-31 21:47:26,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:47:26,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:47:26,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:47:26,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:47:26,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:47:26,706 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-01-31 21:47:27,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:47:27,192 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2022-01-31 21:47:27,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 21:47:27,193 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-01-31 21:47:27,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:47:27,194 INFO L225 Difference]: With dead ends: 84 [2022-01-31 21:47:27,194 INFO L226 Difference]: Without dead ends: 63 [2022-01-31 21:47:27,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:47:27,195 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-01-31 21:47:27,196 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-01-31 21:47:27,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-31 21:47:27,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2022-01-31 21:47:27,204 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-01-31 21:47:27,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-01-31 21:47:27,205 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 49 [2022-01-31 21:47:27,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:47:27,206 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-01-31 21:47:27,206 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-01-31 21:47:27,206 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-01-31 21:47:27,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 21:47:27,207 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:27,208 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-01-31 21:47:27,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 21:47:27,208 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:27,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:27,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2096379008, now seen corresponding path program 1 times [2022-01-31 21:47:27,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:27,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [650507782] [2022-01-31 21:47:27,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:27,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:27,210 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:27,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:47:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:27,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:27,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:47:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:27,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:47:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:27,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:47:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:27,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:27,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:47:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:27,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 21:47:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:27,307 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-31 21:47:27,307 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:47:27,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [650507782] [2022-01-31 21:47:27,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [650507782] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:47:27,307 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:47:27,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:47:27,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957738199] [2022-01-31 21:47:27,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:47:27,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:47:27,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:47:27,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:47:27,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:47:27,309 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-01-31 21:47:27,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:47:27,566 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-01-31 21:47:27,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:47:27,567 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-01-31 21:47:27,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:47:27,568 INFO L225 Difference]: With dead ends: 75 [2022-01-31 21:47:27,568 INFO L226 Difference]: Without dead ends: 73 [2022-01-31 21:47:27,568 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-01-31 21:47:27,569 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-01-31 21:47:27,569 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-01-31 21:47:27,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-01-31 21:47:27,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2022-01-31 21:47:27,593 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-01-31 21:47:27,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2022-01-31 21:47:27,594 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 50 [2022-01-31 21:47:27,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:47:27,594 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2022-01-31 21:47:27,595 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-01-31 21:47:27,595 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2022-01-31 21:47:27,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 21:47:27,595 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:27,595 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-01-31 21:47:27,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 21:47:27,596 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:27,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:27,596 INFO L85 PathProgramCache]: Analyzing trace with hash 983031743, now seen corresponding path program 1 times [2022-01-31 21:47:27,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:27,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [620526385] [2022-01-31 21:47:27,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:27,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:27,598 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:27,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:47:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:27,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:27,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:47:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:27,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:47:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:27,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:47:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:27,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:27,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:47:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:27,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 21:47:27,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:27,921 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 21:47:27,921 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:47:27,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [620526385] [2022-01-31 21:47:27,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [620526385] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:47:27,922 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:47:27,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:47:27,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815774281] [2022-01-31 21:47:27,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:47:27,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:47:27,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:47:27,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:47:27,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:47:27,933 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 16 states, 13 states have (on average 2.1538461538461537) 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-01-31 21:47:28,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:47:28,630 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2022-01-31 21:47:28,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 21:47:28,631 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.1538461538461537) 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-01-31 21:47:28,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:47:28,632 INFO L225 Difference]: With dead ends: 114 [2022-01-31 21:47:28,632 INFO L226 Difference]: Without dead ends: 74 [2022-01-31 21:47:28,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=941, Unknown=0, NotChecked=0, Total=1122 [2022-01-31 21:47:28,634 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 123 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:47:28,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 68 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:47:28,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-01-31 21:47:28,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2022-01-31 21:47:28,643 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-01-31 21:47:28,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2022-01-31 21:47:28,644 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 52 [2022-01-31 21:47:28,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:47:28,644 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2022-01-31 21:47:28,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.1538461538461537) 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-01-31 21:47:28,644 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-01-31 21:47:28,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 21:47:28,645 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:28,645 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-01-31 21:47:28,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 21:47:28,645 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:28,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:28,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2045094069, now seen corresponding path program 1 times [2022-01-31 21:47:28,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:28,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [542975116] [2022-01-31 21:47:28,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:28,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:28,647 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:28,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:47:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:28,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:28,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:47:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:28,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:47:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:28,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:47:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:28,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:28,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:47:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:28,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 21:47:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:28,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-01-31 21:47:28,735 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:47:28,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [542975116] [2022-01-31 21:47:28,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [542975116] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:47:28,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:47:28,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 21:47:28,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972169963] [2022-01-31 21:47:28,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:47:28,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 21:47:28,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:47:28,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 21:47:28,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 21:47:28,737 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-01-31 21:47:28,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:47:28,917 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2022-01-31 21:47:28,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:47:28,918 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-01-31 21:47:28,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:47:28,919 INFO L225 Difference]: With dead ends: 88 [2022-01-31 21:47:28,919 INFO L226 Difference]: Without dead ends: 67 [2022-01-31 21:47:28,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:47:28,920 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-01-31 21:47:28,920 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-01-31 21:47:28,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-31 21:47:28,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-01-31 21:47:28,927 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-01-31 21:47:28,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-01-31 21:47:28,928 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 55 [2022-01-31 21:47:28,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:47:28,928 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-01-31 21:47:28,928 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-01-31 21:47:28,928 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-01-31 21:47:28,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-31 21:47:28,929 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:28,929 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-01-31 21:47:28,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 21:47:28,929 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:28,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:28,929 INFO L85 PathProgramCache]: Analyzing trace with hash 629236887, now seen corresponding path program 1 times [2022-01-31 21:47:28,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:28,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [102215864] [2022-01-31 21:47:28,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:28,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:28,931 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:29,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:47:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:29,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:29,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:47:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:29,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:47:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:29,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:47:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:29,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:29,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:47:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:29,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 21:47:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:29,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 21:47:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:29,179 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-31 21:47:29,179 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:47:29,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [102215864] [2022-01-31 21:47:29,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [102215864] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:47:29,179 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:47:29,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-31 21:47:29,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799626201] [2022-01-31 21:47:29,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:47:29,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 21:47:29,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:47:29,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 21:47:29,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:47:29,181 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-01-31 21:47:29,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:47:29,766 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2022-01-31 21:47:29,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 21:47:29,766 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-01-31 21:47:29,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:47:29,767 INFO L225 Difference]: With dead ends: 101 [2022-01-31 21:47:29,767 INFO L226 Difference]: Without dead ends: 87 [2022-01-31 21:47:29,768 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-01-31 21:47:29,768 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 124 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:47:29,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 60 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:47:29,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-01-31 21:47:29,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 79. [2022-01-31 21:47:29,779 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-01-31 21:47:29,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2022-01-31 21:47:29,780 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 57 [2022-01-31 21:47:29,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:47:29,780 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2022-01-31 21:47:29,781 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-01-31 21:47:29,781 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-01-31 21:47:29,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 21:47:29,781 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:29,782 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-01-31 21:47:29,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 21:47:29,782 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:29,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:29,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1636680555, now seen corresponding path program 2 times [2022-01-31 21:47:29,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:29,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1633623986] [2022-01-31 21:47:29,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:29,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:29,784 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:29,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:47:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:29,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:29,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:47:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:29,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:47:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:30,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:47:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:30,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:30,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:47:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:30,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 21:47:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:30,592 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 21:47:30,593 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:47:30,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1633623986] [2022-01-31 21:47:30,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1633623986] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:47:30,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:47:30,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-31 21:47:30,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625769630] [2022-01-31 21:47:30,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:47:30,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 21:47:30,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:47:30,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 21:47:30,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:47:30,595 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-01-31 21:47:31,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:47:31,835 INFO L93 Difference]: Finished difference Result 140 states and 175 transitions. [2022-01-31 21:47:31,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-31 21:47:31,836 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-01-31 21:47:31,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:47:31,837 INFO L225 Difference]: With dead ends: 140 [2022-01-31 21:47:31,837 INFO L226 Difference]: Without dead ends: 102 [2022-01-31 21:47:31,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=226, Invalid=1580, Unknown=0, NotChecked=0, Total=1806 [2022-01-31 21:47:31,838 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 154 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:47:31,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 66 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:47:31,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-01-31 21:47:31,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 82. [2022-01-31 21:47:31,850 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-01-31 21:47:31,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2022-01-31 21:47:31,850 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 58 [2022-01-31 21:47:31,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:47:31,851 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2022-01-31 21:47:31,851 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-01-31 21:47:31,851 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-01-31 21:47:31,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-31 21:47:31,852 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:31,852 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-01-31 21:47:31,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 21:47:31,852 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:31,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:31,852 INFO L85 PathProgramCache]: Analyzing trace with hash 596047115, now seen corresponding path program 3 times [2022-01-31 21:47:31,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:31,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1065459073] [2022-01-31 21:47:31,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:31,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:31,854 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:31,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:47:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:31,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:31,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:47:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:31,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:47:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:31,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:47:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:31,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:31,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:47:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:31,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 21:47:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:31,915 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-31 21:47:31,915 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:47:31,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1065459073] [2022-01-31 21:47:31,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1065459073] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:47:31,916 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:47:31,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:47:31,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604880177] [2022-01-31 21:47:31,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:47:31,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:47:31,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:47:31,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:47:31,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:47:31,917 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-01-31 21:47:32,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:47:32,184 INFO L93 Difference]: Finished difference Result 129 states and 158 transitions. [2022-01-31 21:47:32,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:47:32,184 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-01-31 21:47:32,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:47:32,185 INFO L225 Difference]: With dead ends: 129 [2022-01-31 21:47:32,185 INFO L226 Difference]: Without dead ends: 92 [2022-01-31 21:47:32,186 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-01-31 21:47:32,186 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 71 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:47:32,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 57 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:47:32,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-01-31 21:47:32,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2022-01-31 21:47:32,198 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-01-31 21:47:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2022-01-31 21:47:32,199 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 61 [2022-01-31 21:47:32,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:47:32,199 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2022-01-31 21:47:32,200 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-01-31 21:47:32,200 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-01-31 21:47:32,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-31 21:47:32,200 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:32,200 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-01-31 21:47:32,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 21:47:32,201 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:32,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:32,201 INFO L85 PathProgramCache]: Analyzing trace with hash 645513954, now seen corresponding path program 1 times [2022-01-31 21:47:32,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:32,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1434655594] [2022-01-31 21:47:32,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:32,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:32,202 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:32,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:47:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:32,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:32,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:47:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:32,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:47:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:32,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:47:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:32,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:32,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:47:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:32,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 21:47:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:32,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 21:47:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:32,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-31 21:47:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:32,278 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-31 21:47:32,278 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:47:32,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1434655594] [2022-01-31 21:47:32,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1434655594] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:47:32,278 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:47:32,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:47:32,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453873983] [2022-01-31 21:47:32,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:47:32,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:47:32,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:47:32,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:47:32,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:47:32,279 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-01-31 21:47:32,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:47:32,539 INFO L93 Difference]: Finished difference Result 109 states and 134 transitions. [2022-01-31 21:47:32,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:47:32,540 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-01-31 21:47:32,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:47:32,541 INFO L225 Difference]: With dead ends: 109 [2022-01-31 21:47:32,541 INFO L226 Difference]: Without dead ends: 98 [2022-01-31 21:47:32,541 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-01-31 21:47:32,542 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-01-31 21:47:32,542 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-01-31 21:47:32,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-01-31 21:47:32,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2022-01-31 21:47:32,553 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-01-31 21:47:32,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2022-01-31 21:47:32,554 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 64 [2022-01-31 21:47:32,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:47:32,554 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2022-01-31 21:47:32,554 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-01-31 21:47:32,555 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2022-01-31 21:47:32,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-31 21:47:32,555 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:32,555 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-01-31 21:47:32,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 21:47:32,555 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:32,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:32,556 INFO L85 PathProgramCache]: Analyzing trace with hash 643666912, now seen corresponding path program 1 times [2022-01-31 21:47:32,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:32,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [478938987] [2022-01-31 21:47:32,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:32,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:32,557 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:32,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:47:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:32,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:32,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:47:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:32,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:47:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:32,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:47:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:32,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:32,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:47:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:32,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 21:47:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:32,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 21:47:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:32,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-31 21:47:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:32,660 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-31 21:47:32,660 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:47:32,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [478938987] [2022-01-31 21:47:32,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [478938987] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:47:32,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:47:32,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:47:32,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144336449] [2022-01-31 21:47:32,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:47:32,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:47:32,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:47:32,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:47:32,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:47:32,662 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-01-31 21:47:32,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:47:32,997 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2022-01-31 21:47:32,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:47:32,998 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-01-31 21:47:32,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:47:32,999 INFO L225 Difference]: With dead ends: 104 [2022-01-31 21:47:32,999 INFO L226 Difference]: Without dead ends: 102 [2022-01-31 21:47:32,999 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-01-31 21:47:32,999 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-01-31 21:47:33,000 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-01-31 21:47:33,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-01-31 21:47:33,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2022-01-31 21:47:33,012 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-01-31 21:47:33,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2022-01-31 21:47:33,012 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 64 [2022-01-31 21:47:33,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:47:33,013 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2022-01-31 21:47:33,013 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-01-31 21:47:33,013 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2022-01-31 21:47:33,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-31 21:47:33,013 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:33,014 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-01-31 21:47:33,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 21:47:33,014 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:33,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:33,014 INFO L85 PathProgramCache]: Analyzing trace with hash -781730101, now seen corresponding path program 1 times [2022-01-31 21:47:33,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:33,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1651019717] [2022-01-31 21:47:33,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:33,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:33,015 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:33,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:47:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:33,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:33,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:47:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:33,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:47:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:33,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:47:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:33,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:33,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:47:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:33,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 21:47:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:33,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 21:47:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:33,320 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-31 21:47:33,320 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:47:33,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1651019717] [2022-01-31 21:47:33,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1651019717] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:47:33,320 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:47:33,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:47:33,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827851200] [2022-01-31 21:47:33,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:47:33,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:47:33,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:47:33,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:47:33,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:47:33,321 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand has 20 states, 17 states have (on average 2.176470588235294) 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-01-31 21:47:34,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:47:34,130 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2022-01-31 21:47:34,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 21:47:34,130 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 2.176470588235294) 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-01-31 21:47:34,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:47:34,131 INFO L225 Difference]: With dead ends: 111 [2022-01-31 21:47:34,131 INFO L226 Difference]: Without dead ends: 109 [2022-01-31 21:47:34,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=1013, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 21:47:34,132 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 118 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:47:34,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 70 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:47:34,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-01-31 21:47:34,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2022-01-31 21:47:34,147 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-01-31 21:47:34,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2022-01-31 21:47:34,148 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 66 [2022-01-31 21:47:34,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:47:34,148 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2022-01-31 21:47:34,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 2.176470588235294) 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-01-31 21:47:34,149 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2022-01-31 21:47:34,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-31 21:47:34,149 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:34,149 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-01-31 21:47:34,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 21:47:34,149 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:34,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:34,150 INFO L85 PathProgramCache]: Analyzing trace with hash -779883059, now seen corresponding path program 1 times [2022-01-31 21:47:34,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:34,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1532289395] [2022-01-31 21:47:34,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:34,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:34,151 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:34,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:47:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:34,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:34,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:47:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:34,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:47:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:34,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:47:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:34,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:34,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:47:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:34,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 21:47:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:34,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 21:47:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:34,298 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-31 21:47:34,298 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:47:34,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1532289395] [2022-01-31 21:47:34,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1532289395] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:47:34,298 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:47:34,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:47:34,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3526081] [2022-01-31 21:47:34,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:47:34,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:47:34,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:47:34,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:47:34,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:47:34,299 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-01-31 21:47:34,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:47:34,730 INFO L93 Difference]: Finished difference Result 124 states and 148 transitions. [2022-01-31 21:47:34,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 21:47:34,731 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-01-31 21:47:34,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:47:34,732 INFO L225 Difference]: With dead ends: 124 [2022-01-31 21:47:34,732 INFO L226 Difference]: Without dead ends: 106 [2022-01-31 21:47:34,732 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-01-31 21:47:34,733 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 84 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:47:34,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 65 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:47:34,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-01-31 21:47:34,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2022-01-31 21:47:34,743 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-01-31 21:47:34,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2022-01-31 21:47:34,744 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 66 [2022-01-31 21:47:34,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:47:34,744 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2022-01-31 21:47:34,744 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-01-31 21:47:34,744 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2022-01-31 21:47:34,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-31 21:47:34,745 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:34,745 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-01-31 21:47:34,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 21:47:34,745 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:34,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:34,745 INFO L85 PathProgramCache]: Analyzing trace with hash 297933182, now seen corresponding path program 1 times [2022-01-31 21:47:34,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:34,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1701906522] [2022-01-31 21:47:34,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:34,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:34,746 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:34,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:47:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:34,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:34,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:47:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:34,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:47:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:34,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:47:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:34,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:34,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:47:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:34,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 21:47:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:34,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 21:47:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:34,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-31 21:47:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:34,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-01-31 21:47:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:34,988 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-31 21:47:34,988 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:47:34,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1701906522] [2022-01-31 21:47:34,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1701906522] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:47:34,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:47:34,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:47:34,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423531485] [2022-01-31 21:47:34,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:47:34,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:47:34,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:47:34,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:47:34,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:47:34,989 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-01-31 21:47:35,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:47:35,463 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2022-01-31 21:47:35,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 21:47:35,463 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-01-31 21:47:35,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:47:35,464 INFO L225 Difference]: With dead ends: 110 [2022-01-31 21:47:35,464 INFO L226 Difference]: Without dead ends: 108 [2022-01-31 21:47:35,464 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-01-31 21:47:35,465 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 113 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:47:35,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 58 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:47:35,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-01-31 21:47:35,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2022-01-31 21:47:35,478 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-01-31 21:47:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2022-01-31 21:47:35,479 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 70 [2022-01-31 21:47:35,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:47:35,479 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2022-01-31 21:47:35,479 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-01-31 21:47:35,479 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2022-01-31 21:47:35,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-31 21:47:35,479 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:35,480 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-01-31 21:47:35,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 21:47:35,480 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:35,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:35,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1867983073, now seen corresponding path program 4 times [2022-01-31 21:47:35,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:35,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1179076783] [2022-01-31 21:47:35,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:35,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:35,481 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:35,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:47:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:35,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:35,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:47:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:35,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:47:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:36,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:47:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:36,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:36,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:47:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:36,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 21:47:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:38,556 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 21:47:38,557 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:47:38,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1179076783] [2022-01-31 21:47:38,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1179076783] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:47:38,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:47:38,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 21:47:38,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082048648] [2022-01-31 21:47:38,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:47:38,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 21:47:38,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:47:38,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 21:47:38,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:47:38,558 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand has 25 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 21 states have internal predecessors, (41), 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-01-31 21:47:40,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:47:40,876 INFO L93 Difference]: Finished difference Result 141 states and 167 transitions. [2022-01-31 21:47:40,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-31 21:47:40,876 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 21 states have internal predecessors, (41), 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-01-31 21:47:40,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:47:40,878 INFO L225 Difference]: With dead ends: 141 [2022-01-31 21:47:40,878 INFO L226 Difference]: Without dead ends: 84 [2022-01-31 21:47:40,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=448, Invalid=2522, Unknown=0, NotChecked=0, Total=2970 [2022-01-31 21:47:40,880 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 118 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:47:40,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 57 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:47:40,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-01-31 21:47:40,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2022-01-31 21:47:40,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 55 states have internal predecessors, (58), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-01-31 21:47:40,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2022-01-31 21:47:40,908 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 67 [2022-01-31 21:47:40,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:47:40,908 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2022-01-31 21:47:40,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 21 states have internal predecessors, (41), 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-01-31 21:47:40,908 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2022-01-31 21:47:40,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-01-31 21:47:40,909 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:40,909 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-01-31 21:47:40,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 21:47:40,909 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:40,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:40,910 INFO L85 PathProgramCache]: Analyzing trace with hash 680409498, now seen corresponding path program 1 times [2022-01-31 21:47:40,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:40,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [159923101] [2022-01-31 21:47:40,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:40,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:40,911 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:41,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:47:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:41,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:41,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:47:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:41,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:47:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:41,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:47:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:41,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:41,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:47:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:41,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 21:47:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:41,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 21:47:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:41,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-31 21:47:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:41,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-01-31 21:47:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:41,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-01-31 21:47:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:41,359 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-01-31 21:47:41,360 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:47:41,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [159923101] [2022-01-31 21:47:41,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [159923101] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:47:41,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:47:41,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 21:47:41,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707999056] [2022-01-31 21:47:41,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:47:41,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 21:47:41,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:47:41,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 21:47:41,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:47:41,361 INFO L87 Difference]: Start difference. First operand 82 states and 93 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-01-31 21:47:42,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:47:42,063 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2022-01-31 21:47:42,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 21:47:42,064 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-01-31 21:47:42,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:47:42,064 INFO L225 Difference]: With dead ends: 88 [2022-01-31 21:47:42,064 INFO L226 Difference]: Without dead ends: 70 [2022-01-31 21:47:42,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2022-01-31 21:47:42,065 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 131 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:47:42,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 58 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:47:42,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-31 21:47:42,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-01-31 21:47:42,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 14 states have call successors, (14), 10 states have call predecessors, (14), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-01-31 21:47:42,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-01-31 21:47:42,079 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 76 [2022-01-31 21:47:42,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:47:42,080 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-01-31 21:47:42,080 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-01-31 21:47:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-01-31 21:47:42,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-31 21:47:42,095 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:42,095 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-01-31 21:47:42,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 21:47:42,095 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:42,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:42,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1166734282, now seen corresponding path program 1 times [2022-01-31 21:47:42,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:42,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1810231810] [2022-01-31 21:47:42,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:42,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:42,097 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:42,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:47:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:42,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:42,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:47:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:42,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:47:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:42,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:47:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:42,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:42,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:47:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:42,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 21:47:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:42,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 21:47:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:42,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-31 21:47:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:42,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 21:47:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:42,267 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-31 21:47:42,267 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:47:42,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1810231810] [2022-01-31 21:47:42,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1810231810] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:47:42,267 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:47:42,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:47:42,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999091268] [2022-01-31 21:47:42,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:47:42,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:47:42,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:47:42,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:47:42,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:47:42,268 INFO L87 Difference]: Start difference. First operand 70 states and 75 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-01-31 21:47:42,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:47:42,641 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2022-01-31 21:47:42,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 21:47:42,641 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-01-31 21:47:42,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:47:42,642 INFO L225 Difference]: With dead ends: 74 [2022-01-31 21:47:42,642 INFO L226 Difference]: Without dead ends: 72 [2022-01-31 21:47:42,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2022-01-31 21:47:42,643 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 70 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:47:42,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 56 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:47:42,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-31 21:47:42,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2022-01-31 21:47:42,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 14 states have call successors, (14), 10 states have call predecessors, (14), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-01-31 21:47:42,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-01-31 21:47:42,657 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 79 [2022-01-31 21:47:42,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:47:42,657 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-01-31 21:47:42,657 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-01-31 21:47:42,657 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-01-31 21:47:42,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-31 21:47:42,658 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:42,658 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-01-31 21:47:42,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 21:47:42,658 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:42,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:42,658 INFO L85 PathProgramCache]: Analyzing trace with hash 690301670, now seen corresponding path program 1 times [2022-01-31 21:47:42,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:42,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1527797248] [2022-01-31 21:47:42,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:42,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:42,662 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:43,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:47:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:43,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:43,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:47:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:43,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:47:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:43,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:47:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:43,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:43,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:47:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:43,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 21:47:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:43,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 21:47:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:43,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-31 21:47:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:43,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 21:47:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:43,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 21:47:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:43,485 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-31 21:47:43,485 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:47:43,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1527797248] [2022-01-31 21:47:43,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1527797248] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:47:43,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:47:43,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 21:47:43,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912150600] [2022-01-31 21:47:43,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:47:43,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 21:47:43,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:47:43,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 21:47:43,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:47:43,486 INFO L87 Difference]: Start difference. First operand 70 states and 75 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-01-31 21:47:44,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:47:44,495 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-01-31 21:47:44,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 21:47:44,495 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-01-31 21:47:44,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:47:44,496 INFO L225 Difference]: With dead ends: 70 [2022-01-31 21:47:44,496 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 21:47:44,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=213, Invalid=1767, Unknown=0, NotChecked=0, Total=1980 [2022-01-31 21:47:44,497 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 87 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:47:44,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 64 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:47:44,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 21:47:44,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 21:47:44,498 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-01-31 21:47:44,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 21:47:44,498 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2022-01-31 21:47:44,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:47:44,498 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 21:47:44,498 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-01-31 21:47:44,498 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 21:47:44,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 21:47:44,500 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 21:47:44,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 21:47:44,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 21:47:50,443 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-01-31 21:47:50,446 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-01-31 21:47:50,446 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-01-31 21:47:50,446 INFO L854 garLoopResultBuilder]: At program point finddupENTRY(lines 33 46) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-01-31 21:47:50,448 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 ((.cse18 (= 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)) (.cse16 (= |finddup_#in~_i.offset| finddup_~_i.offset)) (.cse17 (or .cse22 (not .cse34))) (.cse25 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|)) (.cse26 (store .cse32 .cse33 0))) (let ((.cse7 (= |#memory_int| |old(#memory_int)|)) (.cse2 (not (= (select .cse32 (+ |finddup_#in~a.offset| 4)) (select .cse32 |finddup_#in~a.offset|)))) (.cse3 (<= finddup_~n 2)) (.cse20 (= finddup_~a.offset |finddup_#in~a.offset|)) (.cse14 (= |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)))))) (.cse21 (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 .cse18 .cse28 .cse29 .cse13 .cse4 .cse5 .cse30 .cse16 .cse17) (and (or .cse22 (<= (+ .cse24 2) |finddup_#in~n|)) .cse9 .cse0 .cse11 .cse1 .cse28 .cse12 .cse29 .cse13 (or .cse22 (<= 1 .cse24)) .cse4 .cse5 .cse30 .cse16 .cse17)))) (.cse15 (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 .cse9 .cse10 .cse7 .cse11 .cse1 .cse12 (<= 1 finddup_~j~1) .cse13 .cse14 .cse15 .cse16 .cse17) (and (<= finddup_~j~1 2) .cse7 .cse1 .cse2 .cse3) (let ((.cse19 (= finddup_~a.offset 0))) (and (not (= |finddup_#in~a.offset| 0)) .cse18 (or .cse19 .cse20) .cse21 (or (not .cse19) .cse14))) (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)))))) .cse21 .cse20 .cse14 (or (<= (+ .cse24 1) .cse25) .cse22)) (and .cse10 .cse21 .cse15) (and (<= finddup_~i~1 0) .cse0 .cse1 .cse8 .cse5 .cse6)))))) [2022-01-31 21:47:50,448 INFO L854 garLoopResultBuilder]: At program point L38(lines 38 42) the Hoare annotation is: (let ((.cse24 (* finddup_~i~1 4))) (let ((.cse32 (+ finddup_~a.offset .cse24 4)) (.cse25 (select |#memory_int| finddup_~a.base)) (.cse36 (select |old(#memory_int)| |finddup_#in~a.base|)) (.cse35 ((as const (Array Int Int)) 0))) (let ((.cse23 (* finddup_~j~1 4)) (.cse43 (@diff .cse36 .cse35)) (.cse33 (@diff .cse25 .cse35)) (.cse30 (select .cse25 (+ finddup_~a.offset .cse24))) (.cse27 (select .cse25 .cse32))) (let ((.cse31 (not (= .cse30 .cse27))) (.cse38 (store .cse25 .cse33 0)) (.cse20 (= finddup_~a.offset |finddup_#in~a.offset|)) (.cse8 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse9 (= |finddup_#in~n| finddup_~n)) (.cse10 (<= 1 finddup_~i~1)) (.cse13 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse16 (<= (+ finddup_~j~1 1) finddup_~n)) (.cse17 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse18 (= |finddup_#in~_i.offset| finddup_~_i.offset)) (.cse39 (store .cse36 .cse43 0)) (.cse44 (+ finddup_~i~1 1)) (.cse45 (select .cse25 (+ finddup_~a.offset .cse23))) (.cse37 (not (= .cse30 0))) (.cse34 (= |finddup_#t~mem11| |finddup_#t~mem10|)) (.cse41 (+ finddup_~i~1 2))) (let ((.cse5 (<= finddup_~j~1 .cse41)) (.cse7 (or (not (= .cse45 0)) .cse37 .cse34)) (.cse19 (<= 1 finddup_~j~1)) (.cse11 (= |finddup_#t~mem11| .cse45)) (.cse12 (<= finddup_~j~1 .cse44)) (.cse15 (= |finddup_#t~mem10| .cse30)) (.cse14 (<= .cse44 finddup_~j~1)) (.cse21 (<= finddup_~j~1 1)) (.cse0 (let ((.cse42 (@diff .cse39 .cse35))) (or (not (= .cse35 (store .cse39 .cse42 0))) (not (= (select .cse36 .cse42) (select .cse36 .cse43)))))) (.cse1 (= |#memory_int| |old(#memory_int)|)) (.cse2 (let ((.cse40 (<= .cse41 finddup_~j~1))) (or (and .cse8 .cse9 .cse40 .cse20 .cse13 (<= 0 finddup_~i~1) .cse16 .cse17 .cse18) (and .cse8 .cse9 .cse40 .cse10 .cse13 .cse16 .cse17 .cse18)))) (.cse3 (= |finddup_#in~a.base| finddup_~a.base)) (.cse4 (not (= .cse39 .cse35))) (.cse29 (@diff .cse38 .cse35)) (.cse26 (+ finddup_~a.offset .cse24 8)) (.cse6 (or .cse37 .cse31))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse3 .cse4 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse8 .cse9 .cse19 .cse11 .cse12 .cse20 .cse13 .cse3 .cse14 .cse15 .cse21 .cse17 .cse18) (and (or (= |finddup_#in~_j.base| |finddup_#in~a.base|) (= |finddup_#in~_i.base| |finddup_#in~a.base|) (let ((.cse22 (select |#memory_int| |finddup_#in~a.base|))) (and (= |finddup_#t~mem11| (select .cse22 (+ .cse23 |finddup_#in~a.offset|))) (= (select .cse22 (+ |finddup_#in~a.offset| .cse24)) |finddup_#t~mem10|)))) .cse3 (let ((.cse28 (= finddup_~i~1 0))) (or (and (= (select .cse25 .cse26) .cse27) .cse1 .cse28 .cse2 .cse6) (and (or (and (= .cse27 0) .cse11 .cse15) (not (= (select .cse25 .cse29) .cse30)) (and .cse31 (= .cse32 .cse33))) .cse1 .cse28 .cse2 .cse5 .cse6 .cse7)))) (and .cse1 .cse8 .cse9 .cse34 .cse19 .cse11 .cse12 .cse20 .cse13 .cse3 (not (= .cse35 .cse25)) .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse9 (not (= (select .cse36 (+ |finddup_#in~a.offset| 4)) (select .cse36 |finddup_#in~a.offset|))) (<= finddup_~n 2) .cse14 .cse21) (and (<= finddup_~i~1 0) .cse1 .cse9 (<= finddup_~n 1) .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 (or (= .cse26 .cse33) .cse37 (not (= .cse35 (store .cse38 .cse29 0))) (= .cse29 .cse26)) .cse6))))))) [2022-01-31 21:47:50,448 INFO L854 garLoopResultBuilder]: At program point L36-2(lines 36 44) the Hoare annotation is: (let ((.cse32 (* finddup_~i~1 4))) (let ((.cse14 (select |#memory_int| finddup_~a.base)) (.cse17 (+ finddup_~a.offset .cse32)) (.cse3 (select |old(#memory_int)| |finddup_#in~a.base|)) (.cse24 ((as const (Array Int Int)) 0))) (let ((.cse31 (@diff .cse3 .cse24)) (.cse28 (select .cse14 .cse17))) (let ((.cse23 (not (= .cse28 0))) (.cse16 (select .cse14 (+ finddup_~a.offset .cse32 4))) (.cse29 (store .cse3 .cse31 0)) (.cse27 (+ finddup_~i~1 2)) (.cse8 (+ finddup_~i~1 1))) (let ((.cse2 (<= .cse8 finddup_~n)) (.cse18 (<= .cse27 finddup_~j~1)) (.cse19 (<= 0 finddup_~i~1)) (.cse15 (+ finddup_~a.offset .cse32 8)) (.cse21 (<= (+ finddup_~i~1 3) finddup_~n)) (.cse5 (let ((.cse30 (@diff .cse29 .cse24))) (or (not (= .cse24 (store .cse29 .cse30 0))) (not (= (select .cse3 .cse30) (select .cse3 .cse31)))))) (.cse0 (= |#memory_int| |old(#memory_int)|)) (.cse6 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse1 (= |finddup_#in~n| finddup_~n)) (.cse7 (<= 1 finddup_~i~1)) (.cse9 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse10 (= |finddup_#in~a.base| finddup_~a.base)) (.cse11 (not (= .cse29 .cse24))) (.cse4 (<= .cse8 finddup_~j~1)) (.cse12 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse20 (or .cse23 (not (= .cse28 .cse16)))) (.cse13 (= |finddup_#in~_i.offset| finddup_~_i.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 .cse2 .cse5 .cse0 .cse6 .cse1 .cse7 (<= finddup_~j~1 .cse8) .cse9 .cse10 .cse11 .cse4 .cse12 .cse13) (and (= (select .cse14 .cse15) .cse16) (or (not (= finddup_~a.offset 0)) (= .cse17 0)) .cse0 .cse6 .cse1 .cse18 (= finddup_~a.offset |finddup_#in~a.offset|) .cse9 .cse19 .cse10 .cse12 .cse20 .cse13 .cse21) (and .cse5 .cse0 .cse6 .cse1 .cse18 .cse9 .cse19 .cse10 .cse11 .cse12 (let ((.cse22 (@diff .cse14 .cse24))) (let ((.cse25 (store .cse14 .cse22 0))) (let ((.cse26 (@diff .cse25 .cse24))) (or (= .cse15 .cse22) .cse23 (not (= .cse24 (store .cse25 .cse26 0))) (= .cse26 .cse15))))) .cse20 .cse13 .cse21) (and .cse5 .cse0 .cse6 .cse1 .cse7 .cse9 (<= .cse27 finddup_~n) .cse10 .cse11 .cse4 (<= finddup_~j~1 .cse27) .cse12 .cse20 .cse13))))))) [2022-01-31 21:47:50,448 INFO L854 garLoopResultBuilder]: At program point L36-3(lines 36 44) the Hoare annotation is: (let ((.cse6 (= finddup_~a.offset |finddup_#in~a.offset|)) (.cse2 (= |#memory_int| |old(#memory_int)|)) (.cse3 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse4 (= |finddup_#in~n| finddup_~n)) (.cse5 (<= 1 finddup_~i~1)) (.cse7 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse8 (= |finddup_#in~a.base| finddup_~a.base)) (.cse10 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse11 (= |finddup_#in~_i.offset| finddup_~_i.offset)) (.cse12 (select |old(#memory_int)| |finddup_#in~a.base|)) (.cse9 ((as const (Array Int Int)) 0))) (or (let ((.cse0 (select |#memory_int| finddup_~a.base))) (and (let ((.cse1 (* finddup_~i~1 4))) (= (select .cse0 (+ finddup_~a.offset .cse1)) (select .cse0 (+ finddup_~a.offset .cse1 4)))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ finddup_~i~1 2) finddup_~n) .cse8 (not (= .cse9 .cse0)) (<= (+ finddup_~i~1 1) finddup_~j~1) .cse10 .cse11)) (and .cse2 .cse4 (<= finddup_~n 1)) (and (<= finddup_~j~1 2) .cse2 .cse4 (not (= (select .cse12 (+ |finddup_#in~a.offset| 4)) (select .cse12 |finddup_#in~a.offset|))) (<= finddup_~n 2)) (and .cse2 .cse3 .cse4 (= finddup_~i~1 0) .cse6 .cse7 .cse8 .cse10 .cse11) (let ((.cse15 (@diff .cse12 .cse9))) (let ((.cse13 (store .cse12 .cse15 0))) (and (let ((.cse14 (@diff .cse13 .cse9))) (or (not (= .cse9 (store .cse13 .cse14 0))) (not (= (select .cse12 .cse14) (select .cse12 .cse15))))) .cse2 .cse3 .cse4 .cse5 (<= 1 finddup_~j~1) .cse7 .cse8 (not (= .cse13 .cse9)) .cse10 .cse11))))) [2022-01-31 21:47:50,448 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)) (.cse2 (select |old(#memory_int)| |finddup_#in~a.base|))) (or (and .cse0 .cse1 (<= finddup_~n 1)) (and (<= finddup_~j~1 2) .cse0 .cse1 (not (= (select .cse2 (+ |finddup_#in~a.offset| 4)) (select .cse2 |finddup_#in~a.offset|))) (<= finddup_~n 2)) (let ((.cse3 ((as const (Array Int Int)) 0))) (let ((.cse6 (@diff .cse2 .cse3))) (let ((.cse4 (store .cse2 .cse6 0))) (and (let ((.cse5 (@diff .cse4 .cse3))) (or (not (= .cse3 (store .cse4 .cse5 0))) (not (= (select .cse2 .cse5) (select .cse2 .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|) (= |finddup_#in~a.base| finddup_~a.base) (not (= .cse4 .cse3)) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))))))) [2022-01-31 21:47:50,449 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 ((.cse18 (= 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)) (.cse16 (= |finddup_#in~_i.offset| finddup_~_i.offset)) (.cse17 (or .cse22 (not .cse34))) (.cse25 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|)) (.cse26 (store .cse32 .cse33 0))) (let ((.cse7 (= |#memory_int| |old(#memory_int)|)) (.cse2 (not (= (select .cse32 (+ |finddup_#in~a.offset| 4)) (select .cse32 |finddup_#in~a.offset|)))) (.cse3 (<= finddup_~n 2)) (.cse20 (= finddup_~a.offset |finddup_#in~a.offset|)) (.cse14 (= |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)))))) (.cse21 (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 .cse18 .cse28 .cse29 .cse13 .cse4 .cse5 .cse30 .cse16 .cse17) (and (or .cse22 (<= (+ .cse24 2) |finddup_#in~n|)) .cse9 .cse0 .cse11 .cse1 .cse28 .cse12 .cse29 .cse13 (or .cse22 (<= 1 .cse24)) .cse4 .cse5 .cse30 .cse16 .cse17)))) (.cse15 (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 .cse9 .cse10 .cse7 .cse11 .cse1 .cse12 (<= 1 finddup_~j~1) .cse13 .cse14 .cse15 .cse16 .cse17) (and (<= finddup_~j~1 2) .cse7 .cse1 .cse2 .cse3) (let ((.cse19 (= finddup_~a.offset 0))) (and (not (= |finddup_#in~a.offset| 0)) .cse18 (or .cse19 .cse20) .cse21 (or (not .cse19) .cse14))) (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)))))) .cse21 .cse20 .cse14 (or (<= (+ .cse24 1) .cse25) .cse22)) (and .cse10 .cse21 .cse15) (and (<= finddup_~i~1 0) .cse0 .cse1 .cse8 .cse5 .cse6)))))) [2022-01-31 21:47:50,456 INFO L854 garLoopResultBuilder]: At program point L37-2(lines 37 43) the Hoare annotation is: (let ((.cse12 (select |#memory_int| finddup_~a.base)) (.cse24 ((as const (Array Int Int)) 0))) (let ((.cse30 (* finddup_~i~1 4)) (.cse19 (@diff .cse12 .cse24)) (.cse27 (select |old(#memory_int)| |finddup_#in~a.base|))) (let ((.cse28 (@diff .cse27 .cse24)) (.cse31 (store .cse12 .cse19 0)) (.cse17 (select .cse12 (+ finddup_~a.offset .cse30)))) (let ((.cse29 (not (= .cse17 0))) (.cse14 (select .cse12 (+ finddup_~a.offset .cse30 4))) (.cse18 (@diff .cse31 .cse24)) (.cse25 (store .cse27 .cse28 0)) (.cse5 (= finddup_~a.offset |finddup_#in~a.offset|)) (.cse1 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse2 (= |finddup_#in~n| finddup_~n)) (.cse21 (<= 1 finddup_~i~1)) (.cse6 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse23 (<= (+ finddup_~j~1 1) finddup_~n)) (.cse10 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse11 (= |finddup_#in~_i.offset| finddup_~_i.offset)) (.cse33 (+ finddup_~i~1 1))) (let ((.cse3 (not (= (select .cse27 (+ |finddup_#in~a.offset| 4)) (select .cse27 |finddup_#in~a.offset|)))) (.cse9 (<= finddup_~j~1 1)) (.cse4 (<= finddup_~j~1 .cse33)) (.cse8 (<= .cse33 finddup_~j~1)) (.cse0 (= |#memory_int| |old(#memory_int)|)) (.cse15 (let ((.cse32 (<= (+ finddup_~i~1 2) finddup_~j~1))) (or (and .cse1 .cse2 .cse32 .cse5 .cse6 (<= 0 finddup_~i~1) .cse23 .cse10 .cse11) (and .cse1 .cse2 .cse32 .cse21 .cse6 .cse23 .cse10 .cse11)))) (.cse7 (= |finddup_#in~a.base| finddup_~a.base)) (.cse22 (not (= .cse25 .cse24))) (.cse20 (not (= .cse24 (store .cse31 .cse18 0)))) (.cse13 (+ finddup_~a.offset .cse30 8)) (.cse16 (or .cse29 (not (= .cse17 .cse14))))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 1 finddup_~j~1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (= (select .cse12 .cse13) .cse14) .cse0 (= finddup_~i~1 0) .cse15 .cse7 .cse16) (and .cse0 .cse2 .cse3 (<= finddup_~n 2) .cse8 .cse9) (and (<= finddup_~i~1 0) .cse0 .cse2 (<= finddup_~n 1) .cse9) (and .cse0 (not (= .cse17 (select .cse12 (+ finddup_~a.offset (* finddup_~j~1 4))))) .cse1 .cse2 (or (not (= (select .cse12 .cse18) (select .cse12 .cse19))) .cse20) .cse21 .cse4 .cse6 .cse7 .cse22 .cse8 .cse23 .cse10 .cse11) (and (let ((.cse26 (@diff .cse25 .cse24))) (or (not (= .cse24 (store .cse25 .cse26 0))) (not (= (select .cse27 .cse26) (select .cse27 .cse28))))) .cse0 .cse15 .cse7 .cse22 (or (= .cse13 .cse19) .cse29 .cse20 (= .cse18 .cse13)) .cse16))))))) [2022-01-31 21:47:50,457 INFO L854 garLoopResultBuilder]: At program point L37-3(lines 37 43) the Hoare annotation is: (let ((.cse15 (select |#memory_int| finddup_~a.base)) (.cse35 (* finddup_~i~1 4)) (.cse33 (select |old(#memory_int)| |finddup_#in~a.base|)) (.cse18 ((as const (Array Int Int)) 0))) (let ((.cse30 (+ finddup_~i~1 2)) (.cse34 (@diff .cse33 .cse18)) (.cse14 (select .cse15 (+ finddup_~a.offset .cse35)))) (let ((.cse22 (not (= .cse14 0))) (.cse26 (select .cse15 (+ finddup_~a.offset .cse35 4))) (.cse31 (store .cse33 .cse34 0)) (.cse7 (<= 1 finddup_~i~1)) (.cse0 (= |#memory_int| |old(#memory_int)|)) (.cse6 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse1 (= |finddup_#in~n| finddup_~n)) (.cse27 (= finddup_~i~1 0)) (.cse29 (<= .cse30 finddup_~j~1)) (.cse17 (= finddup_~a.offset |finddup_#in~a.offset|)) (.cse9 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse10 (= |finddup_#in~a.base| finddup_~a.base)) (.cse12 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse13 (= |finddup_#in~_i.offset| finddup_~_i.offset)) (.cse37 (+ finddup_~i~1 1))) (let ((.cse2 (<= .cse37 finddup_~n)) (.cse8 (<= finddup_~j~1 .cse37)) (.cse4 (<= .cse37 finddup_~j~1)) (.cse19 (let ((.cse36 (<= (+ finddup_~i~1 3) finddup_~n))) (or (and .cse0 .cse6 .cse1 .cse29 .cse7 .cse9 .cse12 .cse13 .cse36) (and .cse0 .cse6 .cse1 .cse27 .cse29 .cse17 .cse9 .cse10 .cse12 .cse13 .cse36)))) (.cse20 (+ finddup_~a.offset .cse35 8)) (.cse3 (not (= (select .cse33 (+ |finddup_#in~a.offset| 4)) (select .cse33 |finddup_#in~a.offset|)))) (.cse16 (<= 1 finddup_~j~1)) (.cse5 (let ((.cse32 (@diff .cse31 .cse18))) (or (not (= .cse18 (store .cse31 .cse32 0))) (not (= (select .cse33 .cse32) (select .cse33 .cse34)))))) (.cse11 (not (= .cse31 .cse18))) (.cse28 (<= finddup_~j~1 .cse30)) (.cse25 (or .cse22 (not (= .cse14 .cse26))))) (or (and (<= finddup_~i~1 0) .cse0 .cse1 (<= finddup_~n 1)) (and .cse2 (<= finddup_~j~1 2) .cse0 .cse1 .cse3 (<= finddup_~n 2) .cse4) (and .cse2 .cse5 .cse0 .cse6 .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse13) (and (= .cse14 (select .cse15 (+ finddup_~a.offset (* finddup_~j~1 4)))) .cse0 .cse6 .cse1 .cse16 .cse8 .cse17 .cse9 .cse10 (not (= .cse18 .cse15)) .cse4 (<= (+ finddup_~j~1 1) finddup_~n) .cse12 .cse13) (and .cse0 .cse6 .cse1 .cse16 .cse8 .cse17 .cse9 .cse10 .cse4 (<= finddup_~j~1 1) .cse12 .cse13) (and .cse19 .cse5 .cse10 .cse11 (let ((.cse21 (@diff .cse15 .cse18))) (let ((.cse23 (store .cse15 .cse21 0))) (let ((.cse24 (@diff .cse23 .cse18))) (or (= .cse20 .cse21) .cse22 (not (= .cse18 (store .cse23 .cse24 0))) (= .cse24 .cse20))))) .cse25) (and .cse19 (= (select .cse15 .cse20) .cse26) .cse27 .cse25) (and .cse0 .cse6 .cse1 .cse27 .cse3 .cse16 .cse17 .cse9 .cse10 .cse28 .cse12 .cse13) (and .cse5 .cse0 .cse6 .cse1 .cse29 .cse7 .cse9 (<= .cse30 finddup_~n) .cse10 .cse11 .cse28 .cse12 .cse25 .cse13)))))) [2022-01-31 21:47:50,457 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-01-31 21:47:50,457 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-01-31 21:47:50,457 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 15 17) the Hoare annotation is: true [2022-01-31 21:47:50,457 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-01-31 21:47:50,457 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|)) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ 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|) (= (select |#valid| main_~a~0.base) 1) (not (= |main_~#i~2.base| |main_~#j~2.base|)))) [2022-01-31 21:47:50,457 INFO L854 garLoopResultBuilder]: At program point L62-1(line 62) the Hoare annotation is: (let ((.cse9 (select |#memory_int| main_~a~0.base)) (.cse8 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (let ((.cse0 (<= (+ main_~a~0.base 1) |#StackHeapBarrier|)) (.cse1 (= |main_#t~malloc13.offset| 0)) (.cse2 (= main_~a~0.offset 0)) (.cse3 (not (= main_~a~0.base |main_~#j~2.base|))) (.cse7 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse4 (<= 2 main_~n~0)) (.cse5 (not (= |main_#t~mem22| |main_#t~mem21|))) (.cse6 (= (select |#valid| |main_#t~malloc13.base|) 1)) (.cse10 (select .cse9 (* .cse8 4))) (.cse11 (not (= |main_~#i~2.base| main_~a~0.base))) (.cse12 (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|)) (.cse13 (= (select |#valid| main_~a~0.base) 1)) (.cse14 (not (= |main_~#i~2.base| |main_~#j~2.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ 1 .cse7) .cse8) (= (select .cse9 (* 4 .cse7)) .cse10) .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 (= 0 .cse7) .cse4 .cse5 .cse6 (= .cse10 (select .cse9 0)) .cse11 .cse12 .cse13 .cse14)))) [2022-01-31 21:47:50,457 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|)) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ 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|) (= (select |#valid| main_~a~0.base) 1) (not (= |main_~#i~2.base| |main_~#j~2.base|)))) [2022-01-31 21:47:50,457 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|)) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ 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|) (= (select |#valid| main_~a~0.base) 1) (not (= |main_~#i~2.base| |main_~#j~2.base|)) |main_#t~short17|)) [2022-01-31 21:47:50,457 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|)) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ 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|) (= (select |#valid| main_~a~0.base) 1) (not (= |main_~#i~2.base| |main_~#j~2.base|)) |main_#t~short17|)) [2022-01-31 21:47:50,457 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 48 66) the Hoare annotation is: true [2022-01-31 21:47:50,458 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|)) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|) (= (select |#valid| main_~a~0.base) 1))) [2022-01-31 21:47:50,458 INFO L854 garLoopResultBuilder]: At program point L54-1(line 54) the Hoare annotation is: (let ((.cse1 (select |#memory_int| main_~a~0.base)) (.cse3 ((as const (Array Int Int)) 0))) (let ((.cse4 (@diff .cse1 .cse3))) (let ((.cse2 (store .cse1 .cse4 0))) (let ((.cse5 (@diff .cse2 .cse3)) (.cse0 (* main_~n~0 4))) (and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= |main_#t~malloc13.offset| 0) (or (not (= .cse0 8)) (= (select .cse1 (+ .cse0 (- 4))) (select .cse1 (+ .cse0 (- 8))))) (or (= .cse2 .cse3) (= (select .cse1 .cse4) (select .cse1 .cse5))) (= main_~a~0.offset 0) (= (select |#valid| |main_#t~malloc13.base|) 1) (= .cse3 (store .cse2 .cse5 0)) (<= 8 .cse0) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|) (= (select |#valid| main_~a~0.base) 1)))))) [2022-01-31 21:47:50,458 INFO L854 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (= |main_#t~malloc13.offset| 0) (= |#memory_int| |old(#memory_int)|) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|)) [2022-01-31 21:47:50,458 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|)) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|)) [2022-01-31 21:47:50,458 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 48 66) the Hoare annotation is: true [2022-01-31 21:47:50,459 INFO L854 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (let ((.cse9 (select |#memory_int| main_~a~0.base)) (.cse8 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (let ((.cse0 (<= (+ main_~a~0.base 1) |#StackHeapBarrier|)) (.cse1 (= |main_#t~malloc13.offset| 0)) (.cse2 (= main_~a~0.offset 0)) (.cse3 (not (= main_~a~0.base |main_~#j~2.base|))) (.cse7 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse4 (<= 2 main_~n~0)) (.cse5 (= |main_#t~mem26| |main_#t~mem25|)) (.cse6 (= (select |#valid| |main_#t~malloc13.base|) 1)) (.cse10 (select .cse9 (* .cse8 4))) (.cse11 (not (= |main_~#i~2.base| main_~a~0.base))) (.cse12 (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|)) (.cse13 (= (select |#valid| main_~a~0.base) 1)) (.cse14 (not (= |main_~#i~2.base| |main_~#j~2.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ 1 .cse7) .cse8) (= (select .cse9 (* 4 .cse7)) .cse10) .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 (= 0 .cse7) .cse4 .cse5 .cse6 (= .cse10 (select .cse9 0)) .cse11 .cse12 .cse13 .cse14)))) [2022-01-31 21:47:50,459 INFO L861 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: true [2022-01-31 21:47:50,459 INFO L854 garLoopResultBuilder]: At program point mainENTRY(lines 48 66) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-01-31 21:47:50,459 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|)) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ 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|) (= (select |#valid| main_~a~0.base) 1) (not (= |main_~#i~2.base| |main_~#j~2.base|)) |main_#t~short20|)) [2022-01-31 21:47:50,459 INFO L854 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (let ((.cse1 (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 (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (not (= main_~a~0.base |main_~#j~2.base|)) (let ((.cse0 (= |main_#t~malloc13.offset| 0)) (.cse2 (<= (+ .cse5 1) main_~n~0)) (.cse3 (= main_~a~0.offset 0)) (.cse4 (= main_~r~0 1))) (or (and .cse0 (<= 1 .cse1) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 (= 0 .cse1) .cse4))) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ 1 .cse1) .cse5) (let ((.cse6 (select |#memory_int| main_~a~0.base))) (= (select .cse6 (* 4 .cse1)) (select .cse6 (* .cse5 4)))) (not (= |main_~#i~2.base| main_~a~0.base)) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|) (= (select |#valid| main_~a~0.base) 1) (not (= |main_~#i~2.base| |main_~#j~2.base|)))) [2022-01-31 21:47:50,459 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) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ 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|) (= (select |#valid| main_~a~0.base) 1) (not (= |main_~#i~2.base| |main_~#j~2.base|)) |main_#t~short20|)) [2022-01-31 21:47:50,459 INFO L854 garLoopResultBuilder]: At program point L59-1(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|) (not (= main_~a~0.base |main_~#j~2.base|)) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ 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 (<= 1 .cse0) .cse4 .cse5) (and .cse3 .cse4 .cse5 (= 0 .cse0)))) (not (= |main_~#i~2.base| main_~a~0.base)) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|) (= (select |#valid| main_~a~0.base) 1) (not (= |main_~#i~2.base| |main_~#j~2.base|)))) [2022-01-31 21:47:50,459 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) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ 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|) (= (select |#valid| main_~a~0.base) 1) (not (= |main_~#i~2.base| |main_~#j~2.base|)))) [2022-01-31 21:47:50,459 INFO L854 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse1 (select |#memory_int| main_~a~0.base)) (.cse3 ((as const (Array Int Int)) 0))) (let ((.cse4 (@diff .cse1 .cse3))) (let ((.cse2 (store .cse1 .cse4 0))) (let ((.cse5 (@diff .cse2 .cse3)) (.cse0 (* main_~n~0 4))) (and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= |main_#t~malloc13.offset| 0) (or (not (= .cse0 8)) (= (select .cse1 (+ .cse0 (- 4))) (select .cse1 (+ .cse0 (- 8))))) (or (= .cse2 .cse3) (= (select .cse1 .cse4) (select .cse1 .cse5))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_~#j~2.base|)) (= (select |#valid| |main_#t~malloc13.base|) 1) (= .cse3 (store .cse2 .cse5 0)) (<= 8 .cse0) (not (= |main_~#i~2.base| main_~a~0.base)) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|) (= (select |#valid| main_~a~0.base) 1) (not (= |main_~#i~2.base| |main_~#j~2.base|))))))) [2022-01-31 21:47:50,459 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|)) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ 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|) (= (select |#valid| main_~a~0.base) 1) (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-01-31 21:47:50,460 INFO L854 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-01-31 21:47:50,460 INFO L854 garLoopResultBuilder]: At program point L51-1(line 51) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-01-31 21:47:50,460 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-01-31 21:47:50,460 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-01-31 21:47:50,460 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-01-31 21:47:50,460 INFO L854 garLoopResultBuilder]: At program point mkdupENTRY(lines 19 31) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-01-31 21:47:50,460 INFO L854 garLoopResultBuilder]: At program point mkdupFINAL(lines 19 31) the Hoare annotation is: (let ((.cse7 (select |old(#memory_int)| |mkdup_#in~a.base|)) (.cse3 (select |#memory_int| |mkdup_#in~a.base|))) (let ((.cse8 (@diff .cse7 .cse3))) (let ((.cse6 (select .cse3 .cse8))) (let ((.cse0 (store .cse7 .cse8 .cse6))) (let ((.cse1 (@diff .cse0 .cse3))) (let ((.cse4 (* mkdup_~j~0 4)) (.cse2 (select .cse3 .cse1))) (and (= |mkdup_#in~n| mkdup_~n) (= (store .cse0 .cse1 .cse2) .cse3) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|) (or (= mkdup_~i~0 0) (not (<= mkdup_~i~0 0))) (<= (+ mkdup_~i~0 1) mkdup_~n) (or (< 8 (* |mkdup_#in~n| 4)) (= (select .cse3 |mkdup_#in~a.offset|) (select .cse3 (+ |mkdup_#in~a.offset| 4)))) (not (= .cse4 (* mkdup_~i~0 4))) (or (not (let ((.cse5 ((as const (Array Int Int)) 0))) (= .cse5 (store .cse3 (@diff .cse3 .cse5) 0)))) (= .cse6 0) (= .cse7 .cse3)) (or (and (< 0 mkdup_~j~0) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|)) (= .cse4 0)) (or (= .cse6 .cse2) (= .cse3 .cse0))))))))) [2022-01-31 21:47:50,461 INFO L854 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (let ((.cse0 (* mkdup_~j~0 4))) (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|) (or (= mkdup_~i~0 0) (not (<= mkdup_~i~0 0))) (<= (+ mkdup_~i~0 1) mkdup_~n) (not (= .cse0 (* mkdup_~i~0 4))) (or (and (< 0 mkdup_~j~0) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|)) (= .cse0 0)))) [2022-01-31 21:47:50,461 INFO L854 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (let ((.cse0 (* mkdup_~j~0 4))) (and (= |mkdup_#in~n| mkdup_~n) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= (+ mkdup_~i~0 1) |mkdup_#in~n|) (or (= mkdup_~i~0 0) (not (<= mkdup_~i~0 0))) (or (and (< 0 mkdup_~j~0) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|)) (= .cse0 0)) (or (= mkdup_~a.base |mkdup_#in~a.base|) (= .cse0 (* mkdup_~i~0 4))))) [2022-01-31 21:47:50,461 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) (or (= mkdup_~a.base |mkdup_#in~a.base|) (= (* mkdup_~j~0 4) (* mkdup_~i~0 4)))) [2022-01-31 21:47:50,461 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) (or (= mkdup_~i~0 0) (not (<= mkdup_~i~0 0))) (<= (+ mkdup_~i~0 1) mkdup_~n) (or (= mkdup_~a.base |mkdup_#in~a.base|) (= (* mkdup_~j~0 4) (* mkdup_~i~0 4)))) [2022-01-31 21:47:50,461 INFO L854 garLoopResultBuilder]: At program point mkdupEXIT(lines 19 31) the Hoare annotation is: (let ((.cse7 (select |old(#memory_int)| |mkdup_#in~a.base|)) (.cse3 (select |#memory_int| |mkdup_#in~a.base|))) (let ((.cse8 (@diff .cse7 .cse3))) (let ((.cse6 (select .cse3 .cse8))) (let ((.cse0 (store .cse7 .cse8 .cse6))) (let ((.cse1 (@diff .cse0 .cse3))) (let ((.cse4 (* mkdup_~j~0 4)) (.cse2 (select .cse3 .cse1))) (and (= |mkdup_#in~n| mkdup_~n) (= (store .cse0 .cse1 .cse2) .cse3) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|) (or (= mkdup_~i~0 0) (not (<= mkdup_~i~0 0))) (<= (+ mkdup_~i~0 1) mkdup_~n) (or (< 8 (* |mkdup_#in~n| 4)) (= (select .cse3 |mkdup_#in~a.offset|) (select .cse3 (+ |mkdup_#in~a.offset| 4)))) (not (= .cse4 (* mkdup_~i~0 4))) (or (not (let ((.cse5 ((as const (Array Int Int)) 0))) (= .cse5 (store .cse3 (@diff .cse3 .cse5) 0)))) (= .cse6 0) (= .cse7 .cse3)) (or (and (< 0 mkdup_~j~0) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|)) (= .cse4 0)) (or (= .cse6 .cse2) (= .cse3 .cse0))))))))) [2022-01-31 21:47:50,461 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-01-31 21:47:50,461 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-01-31 21:47:50,461 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-31 21:47:50,461 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-01-31 21:47:50,461 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 11) the Hoare annotation is: true [2022-01-31 21:47:50,461 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-01-31 21:47:50,461 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-01-31 21:47:50,462 INFO L854 garLoopResultBuilder]: At program point L10-1(line 10) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-01-31 21:47:50,462 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-01-31 21:47:50,462 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-01-31 21:47:50,462 INFO L854 garLoopResultBuilder]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-01-31 21:47:50,462 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-01-31 21:47:50,462 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-01-31 21:47:50,466 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:47:50,467 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 21:47:50,478 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.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-01-31 21:47:50,482 INFO L158 Benchmark]: Toolchain (without parser) took 25316.38ms. Allocated memory was 158.3MB in the beginning and 413.1MB in the end (delta: 254.8MB). Free memory was 108.9MB in the beginning and 274.2MB in the end (delta: -165.3MB). Peak memory consumption was 222.2MB. Max. memory is 8.0GB. [2022-01-31 21:47:50,483 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 158.3MB. Free memory was 125.9MB in the beginning and 125.8MB in the end (delta: 71.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 21:47:50,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.46ms. Allocated memory was 158.3MB in the beginning and 191.9MB in the end (delta: 33.6MB). Free memory was 108.7MB in the beginning and 169.1MB in the end (delta: -60.4MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. [2022-01-31 21:47:50,483 INFO L158 Benchmark]: Boogie Preprocessor took 36.51ms. Allocated memory is still 191.9MB. Free memory was 169.1MB in the beginning and 167.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-31 21:47:50,483 INFO L158 Benchmark]: RCFGBuilder took 384.84ms. Allocated memory is still 191.9MB. Free memory was 167.3MB in the beginning and 153.0MB in the end (delta: 14.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-31 21:47:50,484 INFO L158 Benchmark]: TraceAbstraction took 24680.10ms. Allocated memory was 191.9MB in the beginning and 413.1MB in the end (delta: 221.2MB). Free memory was 152.6MB in the beginning and 274.2MB in the end (delta: -121.6MB). Peak memory consumption was 231.6MB. Max. memory is 8.0GB. [2022-01-31 21:47:50,488 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.10ms. Allocated memory is still 158.3MB. Free memory was 125.9MB in the beginning and 125.8MB in the end (delta: 71.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 211.46ms. Allocated memory was 158.3MB in the beginning and 191.9MB in the end (delta: 33.6MB). Free memory was 108.7MB in the beginning and 169.1MB in the end (delta: -60.4MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.51ms. Allocated memory is still 191.9MB. Free memory was 169.1MB in the beginning and 167.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 384.84ms. Allocated memory is still 191.9MB. Free memory was 167.3MB in the beginning and 153.0MB in the end (delta: 14.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 24680.10ms. Allocated memory was 191.9MB in the beginning and 413.1MB in the end (delta: 221.2MB). Free memory was 152.6MB in the beginning and 274.2MB in the end (delta: -121.6MB). Peak memory consumption was 231.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: 24.6s, OverallIterations: 17, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1701 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1647 mSDsluCounter, 1015 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 282 mSDsCounter, 1373 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11595 IncrementalHoareTripleChecker+Invalid, 12968 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1373 mSolverCounterUnsat, 733 mSDtfsCounter, 11595 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 754 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 424 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=13, InterpolantAutomatonStates: 275, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 109 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 59 LocationsWithAnnotation, 468 PreInvPairs, 644 NumberOfFragments, 7843 HoareAnnotationTreeSize, 468 FomulaSimplifications, 653 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 59 FomulaSimplificationsInter, 53395 FormulaSimplificationTreeSizeReductionInter, 4.7s 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-01-31 21:47:50,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...