/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci03.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 01:00:54,807 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 01:00:54,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 01:00:54,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 01:00:54,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 01:00:54,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 01:00:54,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 01:00:54,852 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 01:00:54,853 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 01:00:54,858 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 01:00:54,859 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 01:00:54,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 01:00:54,860 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 01:00:54,860 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 01:00:54,861 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 01:00:54,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 01:00:54,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 01:00:54,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 01:00:54,863 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 01:00:54,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 01:00:54,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 01:00:54,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 01:00:54,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 01:00:54,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 01:00:54,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 01:00:54,879 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 01:00:54,879 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 01:00:54,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 01:00:54,881 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 01:00:54,882 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 01:00:54,882 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 01:00:54,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 01:00:54,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 01:00:54,884 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 01:00:54,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 01:00:54,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 01:00:54,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 01:00:54,886 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 01:00:54,886 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 01:00:54,887 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 01:00:54,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 01:00:54,888 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 01:00:54,912 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 01:00:54,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 01:00:54,913 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 01:00:54,913 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 01:00:54,913 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 01:00:54,913 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 01:00:54,914 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 01:00:54,914 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 01:00:54,914 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 01:00:54,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 01:00:54,914 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 01:00:54,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 01:00:54,915 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 01:00:54,915 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 01:00:54,915 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 01:00:54,915 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 01:00:54,915 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 01:00:54,915 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 01:00:54,915 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 01:00:54,916 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 01:00:54,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 01:00:54,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:00:54,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 01:00:54,916 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 01:00:54,916 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 01:00:54,916 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 01:00:54,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 01:00:54,917 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 01:00:54,917 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 01:00:54,917 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 01:00:54,917 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 01:00:55,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 01:00:55,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 01:00:55,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 01:00:55,090 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 01:00:55,093 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 01:00:55,105 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci03.c [2022-01-10 01:00:55,157 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52dacebe5/466328d03de2465dbd75fddef53d9fe3/FLAG75ebec88e [2022-01-10 01:00:55,538 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 01:00:55,539 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci03.c [2022-01-10 01:00:55,555 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52dacebe5/466328d03de2465dbd75fddef53d9fe3/FLAG75ebec88e [2022-01-10 01:00:55,937 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52dacebe5/466328d03de2465dbd75fddef53d9fe3 [2022-01-10 01:00:55,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 01:00:55,942 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 01:00:55,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 01:00:55,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 01:00:55,959 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 01:00:55,959 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:00:55" (1/1) ... [2022-01-10 01:00:55,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@519d55be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:55, skipping insertion in model container [2022-01-10 01:00:55,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:00:55" (1/1) ... [2022-01-10 01:00:55,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 01:00:55,991 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 01:00:56,211 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci03.c[788,801] [2022-01-10 01:00:56,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:00:56,222 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 01:00:56,237 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci03.c[788,801] [2022-01-10 01:00:56,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:00:56,245 INFO L208 MainTranslator]: Completed translation [2022-01-10 01:00:56,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:56 WrapperNode [2022-01-10 01:00:56,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 01:00:56,248 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 01:00:56,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 01:00:56,249 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 01:00:56,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:56" (1/1) ... [2022-01-10 01:00:56,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:56" (1/1) ... [2022-01-10 01:00:56,278 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2022-01-10 01:00:56,278 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 01:00:56,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 01:00:56,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 01:00:56,279 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 01:00:56,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:56" (1/1) ... [2022-01-10 01:00:56,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:56" (1/1) ... [2022-01-10 01:00:56,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:56" (1/1) ... [2022-01-10 01:00:56,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:56" (1/1) ... [2022-01-10 01:00:56,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:56" (1/1) ... [2022-01-10 01:00:56,292 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:56" (1/1) ... [2022-01-10 01:00:56,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:56" (1/1) ... [2022-01-10 01:00:56,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 01:00:56,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 01:00:56,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 01:00:56,300 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 01:00:56,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:56" (1/1) ... [2022-01-10 01:00:56,305 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:00:56,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:00:56,324 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-10 01:00:56,343 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-10 01:00:56,351 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2022-01-10 01:00:56,351 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2022-01-10 01:00:56,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 01:00:56,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 01:00:56,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 01:00:56,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 01:00:56,404 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 01:00:56,405 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 01:00:56,487 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 01:00:56,491 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 01:00:56,491 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-10 01:00:56,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:00:56 BoogieIcfgContainer [2022-01-10 01:00:56,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 01:00:56,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 01:00:56,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 01:00:56,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 01:00:56,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:00:55" (1/3) ... [2022-01-10 01:00:56,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b0681e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:00:56, skipping insertion in model container [2022-01-10 01:00:56,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:56" (2/3) ... [2022-01-10 01:00:56,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b0681e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:00:56, skipping insertion in model container [2022-01-10 01:00:56,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:00:56" (3/3) ... [2022-01-10 01:00:56,498 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci03.c [2022-01-10 01:00:56,501 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 01:00:56,501 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 01:00:56,536 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 01:00:56,541 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 01:00:56,541 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 01:00:56,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 01:00:56,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 01:00:56,564 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:00:56,564 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:00:56,565 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:00:56,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:00:56,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1939714822, now seen corresponding path program 1 times [2022-01-10 01:00:56,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:00:56,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963822457] [2022-01-10 01:00:56,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:00:56,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:00:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:56,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:56,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:00:56,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:00:56,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963822457] [2022-01-10 01:00:56,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963822457] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:00:56,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:00:56,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 01:00:56,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017069584] [2022-01-10 01:00:56,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:00:56,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:00:56,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:00:56,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:00:56,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:00:56,792 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 01:00:56,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:00:56,908 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-01-10 01:00:56,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:00:56,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-01-10 01:00:56,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:00:56,927 INFO L225 Difference]: With dead ends: 32 [2022-01-10 01:00:56,927 INFO L226 Difference]: Without dead ends: 19 [2022-01-10 01:00:56,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 01:00:56,935 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:00:56,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 53 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:00:56,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-01-10 01:00:56,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-01-10 01:00:56,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-10 01:00:56,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-01-10 01:00:56,961 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2022-01-10 01:00:56,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:00:56,961 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-01-10 01:00:56,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 01:00:56,961 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-01-10 01:00:56,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 01:00:56,962 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:00:56,962 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:00:56,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 01:00:56,963 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:00:56,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:00:56,963 INFO L85 PathProgramCache]: Analyzing trace with hash 692912656, now seen corresponding path program 1 times [2022-01-10 01:00:56,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:00:56,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017682232] [2022-01-10 01:00:56,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:00:56,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:00:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:56,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:57,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:00:57,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:00:57,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017682232] [2022-01-10 01:00:57,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017682232] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:00:57,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:00:57,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 01:00:57,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664780350] [2022-01-10 01:00:57,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:00:57,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:00:57,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:00:57,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:00:57,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:00:57,007 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 01:00:57,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:00:57,038 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-01-10 01:00:57,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:00:57,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-01-10 01:00:57,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:00:57,039 INFO L225 Difference]: With dead ends: 25 [2022-01-10 01:00:57,039 INFO L226 Difference]: Without dead ends: 21 [2022-01-10 01:00:57,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 01:00:57,040 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:00:57,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 36 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:00:57,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-01-10 01:00:57,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-01-10 01:00:57,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-10 01:00:57,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-01-10 01:00:57,045 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2022-01-10 01:00:57,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:00:57,045 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-01-10 01:00:57,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 01:00:57,045 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-01-10 01:00:57,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 01:00:57,046 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:00:57,046 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:00:57,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 01:00:57,046 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:00:57,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:00:57,047 INFO L85 PathProgramCache]: Analyzing trace with hash 453332055, now seen corresponding path program 1 times [2022-01-10 01:00:57,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:00:57,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804300362] [2022-01-10 01:00:57,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:00:57,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:00:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:57,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:57,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:57,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 01:00:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:57,137 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 01:00:57,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:00:57,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804300362] [2022-01-10 01:00:57,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804300362] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:00:57,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194032305] [2022-01-10 01:00:57,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:00:57,138 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:00:57,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:00:57,147 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:00:57,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 01:00:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:57,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 01:00:57,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:00:57,396 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 01:00:57,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:00:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 01:00:57,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194032305] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:00:57,641 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:00:57,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2022-01-10 01:00:57,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852493114] [2022-01-10 01:00:57,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:00:57,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-10 01:00:57,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:00:57,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-10 01:00:57,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-01-10 01:00:57,643 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2022-01-10 01:00:57,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:00:57,847 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-01-10 01:00:57,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 01:00:57,849 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 24 [2022-01-10 01:00:57,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:00:57,850 INFO L225 Difference]: With dead ends: 47 [2022-01-10 01:00:57,850 INFO L226 Difference]: Without dead ends: 30 [2022-01-10 01:00:57,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2022-01-10 01:00:57,852 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 30 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:00:57,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 69 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:00:57,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-10 01:00:57,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-01-10 01:00:57,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-01-10 01:00:57,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2022-01-10 01:00:57,861 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 24 [2022-01-10 01:00:57,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:00:57,861 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 42 transitions. [2022-01-10 01:00:57,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2022-01-10 01:00:57,861 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2022-01-10 01:00:57,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 01:00:57,863 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:00:57,863 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:00:57,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 01:00:58,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:00:58,078 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:00:58,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:00:58,079 INFO L85 PathProgramCache]: Analyzing trace with hash -872442578, now seen corresponding path program 1 times [2022-01-10 01:00:58,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:00:58,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449931273] [2022-01-10 01:00:58,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:00:58,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:00:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:58,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:58,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:58,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:58,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:00:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:58,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:00:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:58,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:58,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:00:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:58,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:58,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:00:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:58,373 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-01-10 01:00:58,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:00:58,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449931273] [2022-01-10 01:00:58,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449931273] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:00:58,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475163703] [2022-01-10 01:00:58,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:00:58,374 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:00:58,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:00:58,385 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:00:58,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 01:00:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:58,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 01:00:58,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:00:58,556 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-01-10 01:00:58,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:00:58,871 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-01-10 01:00:58,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475163703] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:00:58,871 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:00:58,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2022-01-10 01:00:58,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563886527] [2022-01-10 01:00:58,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:00:58,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 01:00:58,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:00:58,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 01:00:58,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-01-10 01:00:58,873 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2022-01-10 01:00:59,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:00:59,075 INFO L93 Difference]: Finished difference Result 74 states and 124 transitions. [2022-01-10 01:00:59,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 01:00:59,075 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 66 [2022-01-10 01:00:59,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:00:59,077 INFO L225 Difference]: With dead ends: 74 [2022-01-10 01:00:59,077 INFO L226 Difference]: Without dead ends: 45 [2022-01-10 01:00:59,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2022-01-10 01:00:59,079 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 58 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:00:59,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 110 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:00:59,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-10 01:00:59,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-01-10 01:00:59,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (24), 9 states have call predecessors, (24), 7 states have call successors, (24) [2022-01-10 01:00:59,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2022-01-10 01:00:59,086 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 66 [2022-01-10 01:00:59,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:00:59,087 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2022-01-10 01:00:59,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2022-01-10 01:00:59,087 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2022-01-10 01:00:59,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-01-10 01:00:59,091 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:00:59,091 INFO L514 BasicCegarLoop]: trace histogram [25, 25, 17, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:00:59,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 01:00:59,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-10 01:00:59,309 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:00:59,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:00:59,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1668610484, now seen corresponding path program 2 times [2022-01-10 01:00:59,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:00:59,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607852211] [2022-01-10 01:00:59,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:00:59,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:00:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:59,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:59,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:59,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:59,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:59,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:59,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:00:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:59,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:00:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:59,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 01:00:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:59,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:59,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:00:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:59,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-10 01:00:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:59,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:59,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:59,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:59,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:00:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:59,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:00:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:59,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 01:00:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:59,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:59,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:59,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:59,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:00:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:59,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:00:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:59,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 01:00:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:59,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:59,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:00:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:59,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 253 proven. 368 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2022-01-10 01:00:59,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:00:59,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607852211] [2022-01-10 01:00:59,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607852211] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:00:59,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573352372] [2022-01-10 01:00:59,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 01:00:59,704 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:00:59,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:00:59,705 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:00:59,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 01:00:59,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 01:00:59,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 01:00:59,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 01:00:59,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:01:00,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 459 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2022-01-10 01:01:00,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:01:01,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 485 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2022-01-10 01:01:01,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573352372] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:01:01,103 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:01:01,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 23 [2022-01-10 01:01:01,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119745054] [2022-01-10 01:01:01,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:01:01,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-10 01:01:01,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:01:01,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-10 01:01:01,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2022-01-10 01:01:01,105 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2022-01-10 01:01:01,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:01:01,481 INFO L93 Difference]: Finished difference Result 116 states and 215 transitions. [2022-01-10 01:01:01,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-10 01:01:01,482 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) Word has length 172 [2022-01-10 01:01:01,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:01:01,483 INFO L225 Difference]: With dead ends: 116 [2022-01-10 01:01:01,483 INFO L226 Difference]: Without dead ends: 73 [2022-01-10 01:01:01,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=438, Invalid=1122, Unknown=0, NotChecked=0, Total=1560 [2022-01-10 01:01:01,485 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 96 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:01:01,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 137 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 01:01:01,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-01-10 01:01:01,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2022-01-10 01:01:01,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (37), 13 states have call predecessors, (37), 11 states have call successors, (37) [2022-01-10 01:01:01,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 100 transitions. [2022-01-10 01:01:01,494 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 100 transitions. Word has length 172 [2022-01-10 01:01:01,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:01:01,494 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 100 transitions. [2022-01-10 01:01:01,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2022-01-10 01:01:01,495 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 100 transitions. [2022-01-10 01:01:01,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2022-01-10 01:01:01,508 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:01:01,508 INFO L514 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:01:01,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-10 01:01:01,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:01:01,726 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:01:01,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:01:01,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2146373423, now seen corresponding path program 3 times [2022-01-10 01:01:01,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:01:01,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006286879] [2022-01-10 01:01:01,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:01:01,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:01:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:01:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 01:01:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 01:01:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:01:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-10 01:01:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:01:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 01:01:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 01:01:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:01:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:02,349 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 844 proven. 1612 refuted. 0 times theorem prover too weak. 4664 trivial. 0 not checked. [2022-01-10 01:01:02,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:01:02,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006286879] [2022-01-10 01:01:02,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006286879] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:01:02,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123438247] [2022-01-10 01:01:02,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 01:01:02,350 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:01:02,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:01:02,351 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:01:02,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 01:01:02,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2022-01-10 01:01:02,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 01:01:02,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 01:01:02,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:01:02,987 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 986 proven. 214 refuted. 0 times theorem prover too weak. 5920 trivial. 0 not checked. [2022-01-10 01:01:02,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:01:04,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 986 proven. 248 refuted. 0 times theorem prover too weak. 5886 trivial. 0 not checked. [2022-01-10 01:01:04,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123438247] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:01:04,284 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:01:04,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 9, 13] total 33 [2022-01-10 01:01:04,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801331635] [2022-01-10 01:01:04,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:01:04,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-10 01:01:04,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:01:04,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-10 01:01:04,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=811, Unknown=0, NotChecked=0, Total=1056 [2022-01-10 01:01:04,286 INFO L87 Difference]: Start difference. First operand 63 states and 100 transitions. Second operand has 33 states, 33 states have (on average 2.393939393939394) internal successors, (79), 33 states have internal predecessors, (79), 16 states have call successors, (25), 1 states have call predecessors, (25), 14 states have return successors, (37), 29 states have call predecessors, (37), 16 states have call successors, (37) [2022-01-10 01:01:04,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:01:04,787 INFO L93 Difference]: Finished difference Result 187 states and 400 transitions. [2022-01-10 01:01:04,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-01-10 01:01:04,788 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.393939393939394) internal successors, (79), 33 states have internal predecessors, (79), 16 states have call successors, (25), 1 states have call predecessors, (25), 14 states have return successors, (37), 29 states have call predecessors, (37), 16 states have call successors, (37) Word has length 352 [2022-01-10 01:01:04,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:01:04,802 INFO L225 Difference]: With dead ends: 187 [2022-01-10 01:01:04,802 INFO L226 Difference]: Without dead ends: 126 [2022-01-10 01:01:04,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 792 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=754, Invalid=2552, Unknown=0, NotChecked=0, Total=3306 [2022-01-10 01:01:04,807 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 222 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 01:01:04,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 219 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 01:01:04,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-01-10 01:01:04,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2022-01-10 01:01:04,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 74 states have internal predecessors, (86), 20 states have call successors, (20), 15 states have call predecessors, (20), 10 states have return successors, (51), 18 states have call predecessors, (51), 20 states have call successors, (51) [2022-01-10 01:01:04,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2022-01-10 01:01:04,861 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 352 [2022-01-10 01:01:04,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:01:04,864 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2022-01-10 01:01:04,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.393939393939394) internal successors, (79), 33 states have internal predecessors, (79), 16 states have call successors, (25), 1 states have call predecessors, (25), 14 states have return successors, (37), 29 states have call predecessors, (37), 16 states have call successors, (37) [2022-01-10 01:01:04,864 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2022-01-10 01:01:04,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 939 [2022-01-10 01:01:04,883 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:01:04,883 INFO L514 BasicCegarLoop]: trace histogram [137, 137, 111, 68, 68, 68, 68, 68, 68, 68, 43, 26, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:01:04,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 01:01:05,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:01:05,101 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:01:05,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:01:05,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1748422918, now seen corresponding path program 4 times [2022-01-10 01:01:05,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:01:05,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497526115] [2022-01-10 01:01:05,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:01:05,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:01:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:05,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:01:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 01:01:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 01:01:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:01:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-10 01:01:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:01:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 01:01:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-01-10 01:01:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:01:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 01:01:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 01:01:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:01:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-01-10 01:01:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:06,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:01:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 01:01:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 01:01:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:01:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-10 01:01:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:01:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 01:01:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-01-10 01:01:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:01:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:01:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2022-01-10 01:01:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:01:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 01:01:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:07,644 INFO L134 CoverageAnalysis]: Checked inductivity of 52481 backedges. 5941 proven. 6883 refuted. 0 times theorem prover too weak. 39657 trivial. 0 not checked. [2022-01-10 01:01:07,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:01:07,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497526115] [2022-01-10 01:01:07,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497526115] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:01:07,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146735433] [2022-01-10 01:01:07,644 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 01:01:07,645 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:01:07,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:01:07,645 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:01:07,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 01:01:07,939 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 01:01:07,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 01:01:07,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 1665 conjuncts, 34 conjunts are in the unsatisfiable core [2022-01-10 01:01:07,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:01:08,963 INFO L134 CoverageAnalysis]: Checked inductivity of 52481 backedges. 4081 proven. 7576 refuted. 0 times theorem prover too weak. 40824 trivial. 0 not checked. [2022-01-10 01:01:08,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:01:15,349 INFO L134 CoverageAnalysis]: Checked inductivity of 52481 backedges. 4081 proven. 7723 refuted. 0 times theorem prover too weak. 40677 trivial. 0 not checked. [2022-01-10 01:01:15,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146735433] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:01:15,349 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:01:15,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 21, 35] total 52 [2022-01-10 01:01:15,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409271144] [2022-01-10 01:01:15,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:01:15,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-01-10 01:01:15,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:01:15,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-01-10 01:01:15,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=586, Invalid=2066, Unknown=0, NotChecked=0, Total=2652 [2022-01-10 01:01:15,368 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 52 states, 52 states have (on average 2.730769230769231) internal successors, (142), 52 states have internal predecessors, (142), 49 states have call successors, (55), 1 states have call predecessors, (55), 18 states have return successors, (83), 33 states have call predecessors, (83), 49 states have call successors, (83) [2022-01-10 01:01:16,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:01:16,448 INFO L93 Difference]: Finished difference Result 258 states and 509 transitions. [2022-01-10 01:01:16,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-01-10 01:01:16,464 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.730769230769231) internal successors, (142), 52 states have internal predecessors, (142), 49 states have call successors, (55), 1 states have call predecessors, (55), 18 states have return successors, (83), 33 states have call predecessors, (83), 49 states have call successors, (83) Word has length 938 [2022-01-10 01:01:16,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:01:16,466 INFO L225 Difference]: With dead ends: 258 [2022-01-10 01:01:16,466 INFO L226 Difference]: Without dead ends: 154 [2022-01-10 01:01:16,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2218 GetRequests, 2134 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1562, Invalid=5080, Unknown=0, NotChecked=0, Total=6642 [2022-01-10 01:01:16,469 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 427 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 01:01:16,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [427 Valid, 274 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 01:01:16,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-01-10 01:01:16,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 127. [2022-01-10 01:01:16,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 91 states have (on average 1.032967032967033) internal successors, (94), 88 states have internal predecessors, (94), 25 states have call successors, (25), 20 states have call predecessors, (25), 10 states have return successors, (64), 18 states have call predecessors, (64), 25 states have call successors, (64) [2022-01-10 01:01:16,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 183 transitions. [2022-01-10 01:01:16,501 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 183 transitions. Word has length 938 [2022-01-10 01:01:16,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:01:16,503 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 183 transitions. [2022-01-10 01:01:16,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.730769230769231) internal successors, (142), 52 states have internal predecessors, (142), 49 states have call successors, (55), 1 states have call predecessors, (55), 18 states have return successors, (83), 33 states have call predecessors, (83), 49 states have call successors, (83) [2022-01-10 01:01:16,503 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 183 transitions. [2022-01-10 01:01:16,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2022-01-10 01:01:16,508 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:01:16,508 INFO L514 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:01:16,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 01:01:16,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:01:16,725 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:01:16,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:01:16,726 INFO L85 PathProgramCache]: Analyzing trace with hash -425340118, now seen corresponding path program 5 times [2022-01-10 01:01:16,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:01:16,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797949174] [2022-01-10 01:01:16,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:01:16,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:01:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:17,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:17,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:17,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:17,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:17,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:17,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:17,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:17,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:17,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:17,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:17,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:17,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:01:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:17,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:17,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:17,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 01:01:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:17,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:17,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:17,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:17,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:17,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 01:01:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:01:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-10 01:01:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:01:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 01:01:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-01-10 01:01:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:01:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 01:01:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 01:01:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:01:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-01-10 01:01:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:01:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 01:01:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 01:01:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:01:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-10 01:01:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:01:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 01:01:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:01:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:01:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:18,656 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2022-01-10 01:01:18,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:01:18,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797949174] [2022-01-10 01:01:18,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797949174] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:01:18,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874986845] [2022-01-10 01:01:18,657 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-10 01:01:18,658 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:01:18,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:01:18,658 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:01:18,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 01:01:19,063 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 93 check-sat command(s) [2022-01-10 01:01:19,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 01:01:19,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 1681 conjuncts, 220 conjunts are in the unsatisfiable core [2022-01-10 01:01:19,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:01:20,121 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2022-01-10 01:01:20,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:01:50,879 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2022-01-10 01:01:50,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874986845] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:01:50,880 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:01:50,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 36 [2022-01-10 01:01:50,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525107045] [2022-01-10 01:01:50,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:01:50,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-10 01:01:50,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:01:50,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-10 01:01:50,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2022-01-10 01:01:50,882 INFO L87 Difference]: Start difference. First operand 127 states and 183 transitions. Second operand has 36 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 19 states have internal predecessors, (43), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (24), 24 states have call predecessors, (24), 8 states have call successors, (24) [2022-01-10 01:01:50,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:01:50,982 INFO L93 Difference]: Finished difference Result 128 states and 184 transitions. [2022-01-10 01:01:50,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-10 01:01:50,983 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 19 states have internal predecessors, (43), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (24), 24 states have call predecessors, (24), 8 states have call successors, (24) Word has length 747 [2022-01-10 01:01:50,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:01:50,984 INFO L225 Difference]: With dead ends: 128 [2022-01-10 01:01:50,984 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 01:01:50,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1932 GetRequests, 1897 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=271, Invalid=1061, Unknown=0, NotChecked=0, Total=1332 [2022-01-10 01:01:50,985 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:01:50,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 291 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:01:50,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 01:01:50,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 01:01:50,986 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-10 01:01:50,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 01:01:50,986 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 747 [2022-01-10 01:01:50,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:01:50,986 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 01:01:50,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 19 states have internal predecessors, (43), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (24), 24 states have call predecessors, (24), 8 states have call successors, (24) [2022-01-10 01:01:50,986 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 01:01:50,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 01:01:50,988 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 01:01:51,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-10 01:01:51,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:01:51,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 01:01:51,644 INFO L858 garLoopResultBuilder]: For program point fibonacciFINAL(lines 16 24) no Hoare annotation was computed. [2022-01-10 01:01:51,645 INFO L861 garLoopResultBuilder]: At program point fibonacciENTRY(lines 16 24) the Hoare annotation is: true [2022-01-10 01:01:51,645 INFO L854 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: (and (<= 2 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|)) [2022-01-10 01:01:51,645 INFO L858 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2022-01-10 01:01:51,645 INFO L854 garLoopResultBuilder]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse0 (<= 1 |fibonacci_#t~ret4|)) (.cse2 (<= 6 fibonacci_~n)) (.cse1 (= fibonacci_~n |fibonacci_#in~n|))) (or (and .cse0 (<= 3 fibonacci_~n) .cse1 (<= |fibonacci_#in~n| 3)) (and (<= 3 |fibonacci_#t~ret4|) (<= 5 fibonacci_~n) .cse1 (<= |fibonacci_#in~n| 5)) (and (<= 21 |fibonacci_#t~ret4|) .cse2 .cse1) (and .cse2 (<= |fibonacci_#in~n| 8) (<= 13 |fibonacci_#t~ret4|) .cse1) (and (<= 8 |fibonacci_#t~ret4|) (<= fibonacci_~n 7) .cse2 .cse1) (and .cse0 (<= |fibonacci_#in~n| 2) (<= 2 fibonacci_~n) .cse1) (and (<= 2 |fibonacci_#t~ret4|) (<= 4 |fibonacci_#in~n|) (<= |fibonacci_#in~n| 4) .cse1) (and (<= 5 |fibonacci_#t~ret4|) .cse2 (<= fibonacci_~n 6) .cse1))) [2022-01-10 01:01:51,645 INFO L858 garLoopResultBuilder]: For program point L19(lines 19 23) no Hoare annotation was computed. [2022-01-10 01:01:51,645 INFO L858 garLoopResultBuilder]: For program point L22-3(line 22) no Hoare annotation was computed. [2022-01-10 01:01:51,645 INFO L858 garLoopResultBuilder]: For program point fibonacciEXIT(lines 16 24) no Hoare annotation was computed. [2022-01-10 01:01:51,645 INFO L858 garLoopResultBuilder]: For program point L17(lines 17 23) no Hoare annotation was computed. [2022-01-10 01:01:51,645 INFO L858 garLoopResultBuilder]: For program point L33(lines 33 37) no Hoare annotation was computed. [2022-01-10 01:01:51,645 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 01:01:51,645 INFO L861 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: true [2022-01-10 01:01:51,646 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 01:01:51,646 INFO L858 garLoopResultBuilder]: For program point L32-1(line 32) no Hoare annotation was computed. [2022-01-10 01:01:51,646 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 01:01:51,646 INFO L858 garLoopResultBuilder]: For program point L29(lines 29 31) no Hoare annotation was computed. [2022-01-10 01:01:51,646 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 01:01:51,646 INFO L861 garLoopResultBuilder]: At program point L27(lines 27 38) the Hoare annotation is: true [2022-01-10 01:01:51,646 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2022-01-10 01:01:51,646 INFO L858 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2022-01-10 01:01:51,648 INFO L732 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2022-01-10 01:01:51,649 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 01:01:51,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:01:51 BoogieIcfgContainer [2022-01-10 01:01:51,655 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 01:01:51,656 INFO L158 Benchmark]: Toolchain (without parser) took 55713.86ms. Allocated memory was 155.2MB in the beginning and 675.3MB in the end (delta: 520.1MB). Free memory was 105.1MB in the beginning and 237.0MB in the end (delta: -131.9MB). Peak memory consumption was 388.0MB. Max. memory is 8.0GB. [2022-01-10 01:01:51,656 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 155.2MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 01:01:51,656 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.85ms. Allocated memory is still 155.2MB. Free memory was 104.9MB in the beginning and 130.3MB in the end (delta: -25.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-10 01:01:51,656 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.15ms. Allocated memory is still 155.2MB. Free memory was 130.3MB in the beginning and 129.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 01:01:51,656 INFO L158 Benchmark]: Boogie Preprocessor took 19.59ms. Allocated memory is still 155.2MB. Free memory was 129.2MB in the beginning and 128.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 01:01:51,656 INFO L158 Benchmark]: RCFGBuilder took 192.77ms. Allocated memory is still 155.2MB. Free memory was 128.2MB in the beginning and 118.7MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-01-10 01:01:51,656 INFO L158 Benchmark]: TraceAbstraction took 55161.72ms. Allocated memory was 155.2MB in the beginning and 675.3MB in the end (delta: 520.1MB). Free memory was 118.2MB in the beginning and 237.0MB in the end (delta: -118.8MB). Peak memory consumption was 402.4MB. Max. memory is 8.0GB. [2022-01-10 01:01:51,657 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.29ms. Allocated memory is still 155.2MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 291.85ms. Allocated memory is still 155.2MB. Free memory was 104.9MB in the beginning and 130.3MB in the end (delta: -25.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.15ms. Allocated memory is still 155.2MB. Free memory was 130.3MB in the beginning and 129.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.59ms. Allocated memory is still 155.2MB. Free memory was 129.2MB in the beginning and 128.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 192.77ms. Allocated memory is still 155.2MB. Free memory was 128.2MB in the beginning and 118.7MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 55161.72ms. Allocated memory was 155.2MB in the beginning and 675.3MB in the end (delta: 520.1MB). Free memory was 118.2MB in the beginning and 237.0MB in the end (delta: -118.8MB). Peak memory consumption was 402.4MB. 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: 36]: 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 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 55.1s, OverallIterations: 8, TraceHistogramMax: 137, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 875 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 851 mSDsluCounter, 1189 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 988 mSDsCounter, 1491 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2059 IncrementalHoareTripleChecker+Invalid, 3550 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1491 mSolverCounterUnsat, 201 mSDtfsCounter, 2059 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5680 GetRequests, 5411 SyntacticMatches, 11 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4021 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=7, InterpolantAutomatonStates: 181, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 57 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 200 PreInvPairs, 303 NumberOfFragments, 112 HoareAnnotationTreeSize, 200 FomulaSimplifications, 1016 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 2758 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 48.9s InterpolantComputationTime, 4621 NumberOfCodeBlocks, 4333 NumberOfCodeBlocksAsserted, 129 NumberOfCheckSat, 6900 ConstructedInterpolants, 0 QuantifiedInterpolants, 11757 SizeOfPredicates, 32 NumberOfNonLiveVariables, 4470 ConjunctsInSsa, 292 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 242864/283494 InterpolantCoveringCapability, 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 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-01-10 01:01:51,716 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...