/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/eca-rers2012/Problem11_label40.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:02:48,500 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:02:48,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:02:48,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:02:48,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:02:48,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:02:48,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:02:48,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:02:48,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:02:48,553 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:02:48,554 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:02:48,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:02:48,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:02:48,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:02:48,569 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:02:48,570 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:02:48,571 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:02:48,571 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:02:48,572 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:02:48,574 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:02:48,575 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:02:48,577 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:02:48,580 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:02:48,581 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:02:48,591 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:02:48,592 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:02:48,592 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:02:48,593 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:02:48,594 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:02:48,594 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:02:48,595 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:02:48,595 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:02:48,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:02:48,597 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:02:48,598 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:02:48,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:02:48,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:02:48,599 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:02:48,599 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:02:48,602 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:02:48,603 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:02:48,604 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 00:02:48,634 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:02:48,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:02:48,634 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:02:48,634 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:02:48,635 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:02:48,635 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:02:48,636 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:02:48,636 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:02:48,636 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:02:48,636 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:02:48,637 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:02:48,637 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:02:48,637 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:02:48,637 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:02:48,638 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:02:48,638 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:02:48,638 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:02:48,638 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:02:48,638 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:02:48,638 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:02:48,638 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:02:48,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:02:48,639 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:02:48,639 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:02:48,639 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:02:48,639 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:02:48,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:02:48,639 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:02:48,639 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:02:48,639 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:02:48,640 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 00:02:48,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:02:48,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:02:48,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:02:48,875 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:02:48,875 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:02:48,876 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label40.c [2022-01-10 00:02:48,929 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a357026f3/7cb85971249e46ef88298f3352c4bf25/FLAGd5f883a1b [2022-01-10 00:02:49,451 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:02:49,452 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label40.c [2022-01-10 00:02:49,471 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a357026f3/7cb85971249e46ef88298f3352c4bf25/FLAGd5f883a1b [2022-01-10 00:02:49,952 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a357026f3/7cb85971249e46ef88298f3352c4bf25 [2022-01-10 00:02:49,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:02:49,955 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:02:49,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:02:49,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:02:49,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:02:49,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:02:49" (1/1) ... [2022-01-10 00:02:49,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ed9e745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:02:49, skipping insertion in model container [2022-01-10 00:02:49,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:02:49" (1/1) ... [2022-01-10 00:02:49,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:02:50,020 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:02:50,189 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label40.c[6409,6422] [2022-01-10 00:02:50,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:02:50,400 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:02:50,420 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label40.c[6409,6422] [2022-01-10 00:02:50,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:02:50,531 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:02:50,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:02:50 WrapperNode [2022-01-10 00:02:50,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:02:50,534 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:02:50,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:02:50,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:02:50,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:02:50" (1/1) ... [2022-01-10 00:02:50,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:02:50" (1/1) ... [2022-01-10 00:02:50,649 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 999 [2022-01-10 00:02:50,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:02:50,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:02:50,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:02:50,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:02:50,657 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:02:50" (1/1) ... [2022-01-10 00:02:50,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:02:50" (1/1) ... [2022-01-10 00:02:50,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:02:50" (1/1) ... [2022-01-10 00:02:50,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:02:50" (1/1) ... [2022-01-10 00:02:50,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:02:50" (1/1) ... [2022-01-10 00:02:50,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:02:50" (1/1) ... [2022-01-10 00:02:50,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:02:50" (1/1) ... [2022-01-10 00:02:50,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:02:50,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:02:50,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:02:50,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:02:50,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:02:50" (1/1) ... [2022-01-10 00:02:50,776 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:02:50,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:02:50,807 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 00:02:50,813 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 00:02:50,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:02:50,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:02:50,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:02:50,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:02:50,894 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:02:50,896 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:02:52,112 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:02:52,126 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:02:52,127 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 00:02:52,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:02:52 BoogieIcfgContainer [2022-01-10 00:02:52,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:02:52,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:02:52,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:02:52,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:02:52,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:02:49" (1/3) ... [2022-01-10 00:02:52,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a7e6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:02:52, skipping insertion in model container [2022-01-10 00:02:52,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:02:50" (2/3) ... [2022-01-10 00:02:52,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a7e6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:02:52, skipping insertion in model container [2022-01-10 00:02:52,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:02:52" (3/3) ... [2022-01-10 00:02:52,137 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem11_label40.c [2022-01-10 00:02:52,145 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:02:52,145 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 00:02:52,194 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:02:52,200 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 00:02:52,200 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 00:02:52,217 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 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 00:02:52,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 00:02:52,223 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:52,223 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:02:52,224 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:52,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:52,228 INFO L85 PathProgramCache]: Analyzing trace with hash 626000386, now seen corresponding path program 1 times [2022-01-10 00:02:52,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:52,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954513115] [2022-01-10 00:02:52,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:52,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:52,448 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 00:02:52,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:52,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954513115] [2022-01-10 00:02:52,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954513115] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:52,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:52,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:02:52,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071085132] [2022-01-10 00:02:52,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:52,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:02:52,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:52,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:02:52,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:52,482 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 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) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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 00:02:53,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:53,417 INFO L93 Difference]: Finished difference Result 761 states and 1345 transitions. [2022-01-10 00:02:53,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:02:53,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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) Word has length 44 [2022-01-10 00:02:53,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:53,430 INFO L225 Difference]: With dead ends: 761 [2022-01-10 00:02:53,430 INFO L226 Difference]: Without dead ends: 413 [2022-01-10 00:02:53,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:53,437 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 184 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:53,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 222 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 00:02:53,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-01-10 00:02:53,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2022-01-10 00:02:53,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 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 00:02:53,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2022-01-10 00:02:53,490 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 44 [2022-01-10 00:02:53,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:53,490 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2022-01-10 00:02:53,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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 00:02:53,491 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2022-01-10 00:02:53,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 00:02:53,494 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:53,495 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:02:53,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:02:53,495 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:53,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:53,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1200539258, now seen corresponding path program 1 times [2022-01-10 00:02:53,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:53,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965921786] [2022-01-10 00:02:53,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:53,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:53,627 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:02:53,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:53,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965921786] [2022-01-10 00:02:53,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965921786] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:53,628 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:53,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:02:53,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520651570] [2022-01-10 00:02:53,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:53,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:02:53,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:53,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:02:53,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:53,631 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 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 00:02:54,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:54,310 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2022-01-10 00:02:54,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:02:54,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 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) Word has length 112 [2022-01-10 00:02:54,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:54,315 INFO L225 Difference]: With dead ends: 1211 [2022-01-10 00:02:54,315 INFO L226 Difference]: Without dead ends: 800 [2022-01-10 00:02:54,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:54,318 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:54,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 118 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 00:02:54,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2022-01-10 00:02:54,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2022-01-10 00:02:54,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3756345177664975) internal successors, (1084), 788 states have internal predecessors, (1084), 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 00:02:54,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1084 transitions. [2022-01-10 00:02:54,345 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1084 transitions. Word has length 112 [2022-01-10 00:02:54,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:54,345 INFO L470 AbstractCegarLoop]: Abstraction has 789 states and 1084 transitions. [2022-01-10 00:02:54,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 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 00:02:54,346 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1084 transitions. [2022-01-10 00:02:54,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-10 00:02:54,349 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:54,349 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:02:54,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 00:02:54,350 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:54,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:54,350 INFO L85 PathProgramCache]: Analyzing trace with hash -590739588, now seen corresponding path program 1 times [2022-01-10 00:02:54,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:54,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079832318] [2022-01-10 00:02:54,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:54,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:54,483 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:02:54,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:54,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079832318] [2022-01-10 00:02:54,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079832318] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:54,484 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:54,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:02:54,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105150902] [2022-01-10 00:02:54,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:54,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:02:54,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:54,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:02:54,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:54,486 INFO L87 Difference]: Start difference. First operand 789 states and 1084 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 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 00:02:55,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:55,113 INFO L93 Difference]: Finished difference Result 1945 states and 2614 transitions. [2022-01-10 00:02:55,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:02:55,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 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) Word has length 113 [2022-01-10 00:02:55,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:55,119 INFO L225 Difference]: With dead ends: 1945 [2022-01-10 00:02:55,119 INFO L226 Difference]: Without dead ends: 1158 [2022-01-10 00:02:55,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:55,121 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:55,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 00:02:55,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2022-01-10 00:02:55,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1157. [2022-01-10 00:02:55,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.2716262975778547) internal successors, (1470), 1156 states have internal predecessors, (1470), 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 00:02:55,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1470 transitions. [2022-01-10 00:02:55,155 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1470 transitions. Word has length 113 [2022-01-10 00:02:55,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:55,157 INFO L470 AbstractCegarLoop]: Abstraction has 1157 states and 1470 transitions. [2022-01-10 00:02:55,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 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 00:02:55,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1470 transitions. [2022-01-10 00:02:55,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-10 00:02:55,161 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:55,162 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:02:55,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 00:02:55,162 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:55,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:55,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1199532265, now seen corresponding path program 1 times [2022-01-10 00:02:55,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:55,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940591894] [2022-01-10 00:02:55,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:55,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:55,297 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:02:55,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:55,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940591894] [2022-01-10 00:02:55,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940591894] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:55,298 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:55,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:02:55,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281037491] [2022-01-10 00:02:55,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:55,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:02:55,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:55,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:02:55,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:02:55,300 INFO L87 Difference]: Start difference. First operand 1157 states and 1470 transitions. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 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 00:02:56,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:56,442 INFO L93 Difference]: Finished difference Result 3445 states and 4568 transitions. [2022-01-10 00:02:56,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:02:56,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 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) Word has length 171 [2022-01-10 00:02:56,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:56,451 INFO L225 Difference]: With dead ends: 3445 [2022-01-10 00:02:56,452 INFO L226 Difference]: Without dead ends: 2474 [2022-01-10 00:02:56,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:02:56,454 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 320 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:56,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 95 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 00:02:56,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2022-01-10 00:02:56,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2473. [2022-01-10 00:02:56,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2473 states, 2472 states have (on average 1.287621359223301) internal successors, (3183), 2472 states have internal predecessors, (3183), 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 00:02:56,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 3183 transitions. [2022-01-10 00:02:56,498 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 3183 transitions. Word has length 171 [2022-01-10 00:02:56,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:56,499 INFO L470 AbstractCegarLoop]: Abstraction has 2473 states and 3183 transitions. [2022-01-10 00:02:56,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 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 00:02:56,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3183 transitions. [2022-01-10 00:02:56,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-01-10 00:02:56,501 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:56,502 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:02:56,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 00:02:56,502 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:56,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:56,503 INFO L85 PathProgramCache]: Analyzing trace with hash -362773066, now seen corresponding path program 1 times [2022-01-10 00:02:56,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:56,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84386596] [2022-01-10 00:02:56,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:56,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:56,620 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:02:56,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:56,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84386596] [2022-01-10 00:02:56,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84386596] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:56,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:56,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:02:56,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113952618] [2022-01-10 00:02:56,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:56,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:02:56,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:56,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:02:56,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:56,624 INFO L87 Difference]: Start difference. First operand 2473 states and 3183 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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 00:02:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:57,334 INFO L93 Difference]: Finished difference Result 5695 states and 7520 transitions. [2022-01-10 00:02:57,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:02:57,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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) Word has length 224 [2022-01-10 00:02:57,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:57,346 INFO L225 Difference]: With dead ends: 5695 [2022-01-10 00:02:57,346 INFO L226 Difference]: Without dead ends: 3592 [2022-01-10 00:02:57,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:57,349 INFO L933 BasicCegarLoop]: 326 mSDtfsCounter, 136 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:57,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 347 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 00:02:57,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3592 states. [2022-01-10 00:02:57,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3592 to 3579. [2022-01-10 00:02:57,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3579 states, 3578 states have (on average 1.252375628842929) internal successors, (4481), 3578 states have internal predecessors, (4481), 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 00:02:57,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3579 states to 3579 states and 4481 transitions. [2022-01-10 00:02:57,407 INFO L78 Accepts]: Start accepts. Automaton has 3579 states and 4481 transitions. Word has length 224 [2022-01-10 00:02:57,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:57,408 INFO L470 AbstractCegarLoop]: Abstraction has 3579 states and 4481 transitions. [2022-01-10 00:02:57,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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 00:02:57,408 INFO L276 IsEmpty]: Start isEmpty. Operand 3579 states and 4481 transitions. [2022-01-10 00:02:57,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-01-10 00:02:57,410 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:57,411 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:02:57,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 00:02:57,411 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:57,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:57,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1808781376, now seen corresponding path program 1 times [2022-01-10 00:02:57,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:57,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139064920] [2022-01-10 00:02:57,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:57,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:57,506 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-01-10 00:02:57,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:57,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139064920] [2022-01-10 00:02:57,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139064920] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:57,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:57,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:02:57,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759806296] [2022-01-10 00:02:57,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:57,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:02:57,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:57,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:02:57,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:57,508 INFO L87 Difference]: Start difference. First operand 3579 states and 4481 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 00:02:58,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:58,098 INFO L93 Difference]: Finished difference Result 7726 states and 9781 transitions. [2022-01-10 00:02:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:02:58,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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) Word has length 225 [2022-01-10 00:02:58,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:58,113 INFO L225 Difference]: With dead ends: 7726 [2022-01-10 00:02:58,113 INFO L226 Difference]: Without dead ends: 4517 [2022-01-10 00:02:58,117 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:58,117 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 158 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:58,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 346 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 00:02:58,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2022-01-10 00:02:58,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 4499. [2022-01-10 00:02:58,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4499 states, 4498 states have (on average 1.240773677189862) internal successors, (5581), 4498 states have internal predecessors, (5581), 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 00:02:58,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4499 states to 4499 states and 5581 transitions. [2022-01-10 00:02:58,188 INFO L78 Accepts]: Start accepts. Automaton has 4499 states and 5581 transitions. Word has length 225 [2022-01-10 00:02:58,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:58,188 INFO L470 AbstractCegarLoop]: Abstraction has 4499 states and 5581 transitions. [2022-01-10 00:02:58,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 00:02:58,189 INFO L276 IsEmpty]: Start isEmpty. Operand 4499 states and 5581 transitions. [2022-01-10 00:02:58,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-01-10 00:02:58,191 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:58,191 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:02:58,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 00:02:58,192 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:58,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:58,192 INFO L85 PathProgramCache]: Analyzing trace with hash -218901039, now seen corresponding path program 1 times [2022-01-10 00:02:58,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:58,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020217621] [2022-01-10 00:02:58,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:58,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:58,327 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-01-10 00:02:58,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:58,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020217621] [2022-01-10 00:02:58,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020217621] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:58,328 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:58,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:02:58,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019005800] [2022-01-10 00:02:58,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:58,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:02:58,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:58,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:02:58,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:58,329 INFO L87 Difference]: Start difference. First operand 4499 states and 5581 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 00:02:59,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:59,031 INFO L93 Difference]: Finished difference Result 9741 states and 12305 transitions. [2022-01-10 00:02:59,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:02:59,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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) Word has length 226 [2022-01-10 00:02:59,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:59,048 INFO L225 Difference]: With dead ends: 9741 [2022-01-10 00:02:59,048 INFO L226 Difference]: Without dead ends: 5612 [2022-01-10 00:02:59,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:59,054 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 153 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:59,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 371 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 00:02:59,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5612 states. [2022-01-10 00:02:59,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5612 to 5419. [2022-01-10 00:02:59,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5419 states, 5418 states have (on average 1.2331118493909192) internal successors, (6681), 5418 states have internal predecessors, (6681), 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 00:02:59,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5419 states to 5419 states and 6681 transitions. [2022-01-10 00:02:59,130 INFO L78 Accepts]: Start accepts. Automaton has 5419 states and 6681 transitions. Word has length 226 [2022-01-10 00:02:59,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:59,131 INFO L470 AbstractCegarLoop]: Abstraction has 5419 states and 6681 transitions. [2022-01-10 00:02:59,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 00:02:59,131 INFO L276 IsEmpty]: Start isEmpty. Operand 5419 states and 6681 transitions. [2022-01-10 00:02:59,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2022-01-10 00:02:59,134 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:59,134 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:02:59,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 00:02:59,135 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:59,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:59,140 INFO L85 PathProgramCache]: Analyzing trace with hash -25691425, now seen corresponding path program 1 times [2022-01-10 00:02:59,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:59,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883593216] [2022-01-10 00:02:59,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:59,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:59,303 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-01-10 00:02:59,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:59,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883593216] [2022-01-10 00:02:59,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883593216] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:02:59,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923534199] [2022-01-10 00:02:59,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:59,305 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:02:59,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:02:59,311 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 00:02:59,383 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 00:02:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:59,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 00:02:59,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:03:00,739 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-01-10 00:03:00,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:03:01,519 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-01-10 00:03:01,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923534199] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 00:03:01,519 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-10 00:03:01,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2022-01-10 00:03:01,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401492581] [2022-01-10 00:03:01,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:03:01,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:03:01,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:03:01,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:03:01,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:03:01,521 INFO L87 Difference]: Start difference. First operand 5419 states and 6681 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 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 00:03:02,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:03:02,873 INFO L93 Difference]: Finished difference Result 13052 states and 16454 transitions. [2022-01-10 00:03:02,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:03:02,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 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) Word has length 246 [2022-01-10 00:03:02,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:03:02,902 INFO L225 Difference]: With dead ends: 13052 [2022-01-10 00:03:02,903 INFO L226 Difference]: Without dead ends: 8929 [2022-01-10 00:03:02,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 487 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:03:02,909 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 299 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-10 00:03:02,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 69 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-10 00:03:02,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8929 states. [2022-01-10 00:03:03,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8929 to 8193. [2022-01-10 00:03:03,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8193 states, 8192 states have (on average 1.245849609375) internal successors, (10206), 8192 states have internal predecessors, (10206), 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 00:03:03,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8193 states to 8193 states and 10206 transitions. [2022-01-10 00:03:03,051 INFO L78 Accepts]: Start accepts. Automaton has 8193 states and 10206 transitions. Word has length 246 [2022-01-10 00:03:03,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:03:03,051 INFO L470 AbstractCegarLoop]: Abstraction has 8193 states and 10206 transitions. [2022-01-10 00:03:03,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 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 00:03:03,052 INFO L276 IsEmpty]: Start isEmpty. Operand 8193 states and 10206 transitions. [2022-01-10 00:03:03,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-01-10 00:03:03,055 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:03:03,056 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:03:03,080 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 00:03:03,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:03:03,272 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:03:03,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:03:03,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1131175066, now seen corresponding path program 1 times [2022-01-10 00:03:03,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:03:03,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280042595] [2022-01-10 00:03:03,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:03:03,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:03:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:03:03,381 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-01-10 00:03:03,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:03:03,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280042595] [2022-01-10 00:03:03,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280042595] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:03:03,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:03:03,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:03:03,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927160192] [2022-01-10 00:03:03,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:03:03,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:03:03,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:03:03,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:03:03,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:03:03,383 INFO L87 Difference]: Start difference. First operand 8193 states and 10206 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 00:03:04,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:03:04,117 INFO L93 Difference]: Finished difference Result 16207 states and 20235 transitions. [2022-01-10 00:03:04,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:03:04,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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) Word has length 253 [2022-01-10 00:03:04,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:03:04,132 INFO L225 Difference]: With dead ends: 16207 [2022-01-10 00:03:04,133 INFO L226 Difference]: Without dead ends: 8200 [2022-01-10 00:03:04,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:03:04,142 INFO L933 BasicCegarLoop]: 357 mSDtfsCounter, 157 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 00:03:04,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 379 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 00:03:04,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8200 states. [2022-01-10 00:03:04,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8200 to 8192. [2022-01-10 00:03:04,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8192 states, 8191 states have (on average 1.2020510316200708) internal successors, (9846), 8191 states have internal predecessors, (9846), 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 00:03:04,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8192 states to 8192 states and 9846 transitions. [2022-01-10 00:03:04,280 INFO L78 Accepts]: Start accepts. Automaton has 8192 states and 9846 transitions. Word has length 253 [2022-01-10 00:03:04,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:03:04,280 INFO L470 AbstractCegarLoop]: Abstraction has 8192 states and 9846 transitions. [2022-01-10 00:03:04,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 00:03:04,281 INFO L276 IsEmpty]: Start isEmpty. Operand 8192 states and 9846 transitions. [2022-01-10 00:03:04,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2022-01-10 00:03:04,287 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:03:04,287 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:03:04,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 00:03:04,288 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:03:04,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:03:04,288 INFO L85 PathProgramCache]: Analyzing trace with hash 126662482, now seen corresponding path program 1 times [2022-01-10 00:03:04,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:03:04,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257223423] [2022-01-10 00:03:04,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:03:04,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:03:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:03:04,400 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-01-10 00:03:04,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:03:04,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257223423] [2022-01-10 00:03:04,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257223423] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:03:04,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:03:04,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:03:04,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665479996] [2022-01-10 00:03:04,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:03:04,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:03:04,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:03:04,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:03:04,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:03:04,402 INFO L87 Difference]: Start difference. First operand 8192 states and 9846 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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 00:03:05,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:03:05,056 INFO L93 Difference]: Finished difference Result 18400 states and 22298 transitions. [2022-01-10 00:03:05,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:03:05,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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) Word has length 293 [2022-01-10 00:03:05,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:03:05,072 INFO L225 Difference]: With dead ends: 18400 [2022-01-10 00:03:05,072 INFO L226 Difference]: Without dead ends: 10392 [2022-01-10 00:03:05,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:03:05,082 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 174 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:03:05,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 152 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 00:03:05,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10392 states. [2022-01-10 00:03:05,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10392 to 9283. [2022-01-10 00:03:05,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9283 states, 9282 states have (on average 1.152014652014652) internal successors, (10693), 9282 states have internal predecessors, (10693), 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 00:03:05,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9283 states to 9283 states and 10693 transitions. [2022-01-10 00:03:05,256 INFO L78 Accepts]: Start accepts. Automaton has 9283 states and 10693 transitions. Word has length 293 [2022-01-10 00:03:05,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:03:05,256 INFO L470 AbstractCegarLoop]: Abstraction has 9283 states and 10693 transitions. [2022-01-10 00:03:05,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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 00:03:05,257 INFO L276 IsEmpty]: Start isEmpty. Operand 9283 states and 10693 transitions. [2022-01-10 00:03:05,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2022-01-10 00:03:05,264 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:03:05,264 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:03:05,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 00:03:05,265 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:03:05,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:03:05,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1759383677, now seen corresponding path program 1 times [2022-01-10 00:03:05,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:03:05,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393938803] [2022-01-10 00:03:05,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:03:05,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:03:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:03:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-01-10 00:03:05,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:03:05,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393938803] [2022-01-10 00:03:05,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393938803] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:03:05,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:03:05,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:03:05,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88670134] [2022-01-10 00:03:05,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:03:05,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:03:05,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:03:05,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:03:05,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:03:05,393 INFO L87 Difference]: Start difference. First operand 9283 states and 10693 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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 00:03:06,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:03:06,001 INFO L93 Difference]: Finished difference Result 17270 states and 19957 transitions. [2022-01-10 00:03:06,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:03:06,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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) Word has length 323 [2022-01-10 00:03:06,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:03:06,051 INFO L225 Difference]: With dead ends: 17270 [2022-01-10 00:03:06,051 INFO L226 Difference]: Without dead ends: 9281 [2022-01-10 00:03:06,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:03:06,074 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 148 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 00:03:06,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 299 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 00:03:06,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9281 states. [2022-01-10 00:03:06,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9281 to 8729. [2022-01-10 00:03:06,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8729 states, 8728 states have (on average 1.135884509624198) internal successors, (9914), 8728 states have internal predecessors, (9914), 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 00:03:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8729 states to 8729 states and 9914 transitions. [2022-01-10 00:03:06,292 INFO L78 Accepts]: Start accepts. Automaton has 8729 states and 9914 transitions. Word has length 323 [2022-01-10 00:03:06,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:03:06,292 INFO L470 AbstractCegarLoop]: Abstraction has 8729 states and 9914 transitions. [2022-01-10 00:03:06,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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 00:03:06,293 INFO L276 IsEmpty]: Start isEmpty. Operand 8729 states and 9914 transitions. [2022-01-10 00:03:06,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2022-01-10 00:03:06,301 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:03:06,301 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:03:06,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 00:03:06,301 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:03:06,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:03:06,302 INFO L85 PathProgramCache]: Analyzing trace with hash -126252397, now seen corresponding path program 1 times [2022-01-10 00:03:06,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:03:06,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496499595] [2022-01-10 00:03:06,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:03:06,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:03:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:03:06,445 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-01-10 00:03:06,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:03:06,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496499595] [2022-01-10 00:03:06,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496499595] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:03:06,446 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:03:06,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:03:06,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235697181] [2022-01-10 00:03:06,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:03:06,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:03:06,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:03:06,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:03:06,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:03:06,448 INFO L87 Difference]: Start difference. First operand 8729 states and 9914 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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 00:03:07,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:03:07,131 INFO L93 Difference]: Finished difference Result 21136 states and 24080 transitions. [2022-01-10 00:03:07,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:03:07,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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) Word has length 342 [2022-01-10 00:03:07,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:03:07,150 INFO L225 Difference]: With dead ends: 21136 [2022-01-10 00:03:07,151 INFO L226 Difference]: Without dead ends: 12777 [2022-01-10 00:03:07,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:03:07,162 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 175 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:03:07,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 297 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 00:03:07,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12777 states. [2022-01-10 00:03:07,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12777 to 11120. [2022-01-10 00:03:07,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11120 states, 11119 states have (on average 1.123572263692778) internal successors, (12493), 11119 states have internal predecessors, (12493), 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 00:03:07,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11120 states to 11120 states and 12493 transitions. [2022-01-10 00:03:07,389 INFO L78 Accepts]: Start accepts. Automaton has 11120 states and 12493 transitions. Word has length 342 [2022-01-10 00:03:07,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:03:07,389 INFO L470 AbstractCegarLoop]: Abstraction has 11120 states and 12493 transitions. [2022-01-10 00:03:07,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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 00:03:07,390 INFO L276 IsEmpty]: Start isEmpty. Operand 11120 states and 12493 transitions. [2022-01-10 00:03:07,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2022-01-10 00:03:07,426 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:03:07,427 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:03:07,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 00:03:07,427 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:03:07,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:03:07,428 INFO L85 PathProgramCache]: Analyzing trace with hash -575963578, now seen corresponding path program 1 times [2022-01-10 00:03:07,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:03:07,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107177525] [2022-01-10 00:03:07,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:03:07,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:03:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:03:07,628 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2022-01-10 00:03:07,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:03:07,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107177525] [2022-01-10 00:03:07,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107177525] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:03:07,629 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:03:07,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:03:07,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707064184] [2022-01-10 00:03:07,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:03:07,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:03:07,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:03:07,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:03:07,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:03:07,631 INFO L87 Difference]: Start difference. First operand 11120 states and 12493 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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 00:03:08,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:03:08,242 INFO L93 Difference]: Finished difference Result 22601 states and 25416 transitions. [2022-01-10 00:03:08,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:03:08,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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) Word has length 439 [2022-01-10 00:03:08,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:03:08,256 INFO L225 Difference]: With dead ends: 22601 [2022-01-10 00:03:08,256 INFO L226 Difference]: Without dead ends: 12959 [2022-01-10 00:03:08,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:03:08,265 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 177 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 00:03:08,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 139 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 00:03:08,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12959 states. [2022-01-10 00:03:08,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12959 to 8347. [2022-01-10 00:03:08,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8347 states, 8346 states have (on average 1.1284447639587827) internal successors, (9418), 8346 states have internal predecessors, (9418), 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 00:03:08,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8347 states to 8347 states and 9418 transitions. [2022-01-10 00:03:08,475 INFO L78 Accepts]: Start accepts. Automaton has 8347 states and 9418 transitions. Word has length 439 [2022-01-10 00:03:08,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:03:08,475 INFO L470 AbstractCegarLoop]: Abstraction has 8347 states and 9418 transitions. [2022-01-10 00:03:08,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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 00:03:08,482 INFO L276 IsEmpty]: Start isEmpty. Operand 8347 states and 9418 transitions. [2022-01-10 00:03:08,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2022-01-10 00:03:08,497 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:03:08,497 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:03:08,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 00:03:08,497 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:03:08,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:03:08,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1542853619, now seen corresponding path program 1 times [2022-01-10 00:03:08,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:03:08,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095054312] [2022-01-10 00:03:08,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:03:08,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:03:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:03:08,731 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-01-10 00:03:08,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:03:08,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095054312] [2022-01-10 00:03:08,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095054312] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:03:08,732 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:03:08,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:03:08,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512894635] [2022-01-10 00:03:08,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:03:08,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:03:08,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:03:08,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:03:08,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:03:08,734 INFO L87 Difference]: Start difference. First operand 8347 states and 9418 transitions. Second operand has 4 states, 4 states have (on average 102.0) internal successors, (408), 3 states have internal predecessors, (408), 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 00:03:09,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:03:09,659 INFO L93 Difference]: Finished difference Result 18534 states and 20893 transitions. [2022-01-10 00:03:09,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:03:09,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 102.0) internal successors, (408), 3 states have internal predecessors, (408), 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) Word has length 449 [2022-01-10 00:03:09,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:03:09,669 INFO L225 Difference]: With dead ends: 18534 [2022-01-10 00:03:09,669 INFO L226 Difference]: Without dead ends: 10557 [2022-01-10 00:03:09,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:03:09,677 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 99 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 00:03:09,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 130 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 00:03:09,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10557 states. [2022-01-10 00:03:09,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10557 to 10187. [2022-01-10 00:03:09,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10187 states, 10186 states have (on average 1.1175142352248184) internal successors, (11383), 10186 states have internal predecessors, (11383), 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 00:03:09,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10187 states to 10187 states and 11383 transitions. [2022-01-10 00:03:09,795 INFO L78 Accepts]: Start accepts. Automaton has 10187 states and 11383 transitions. Word has length 449 [2022-01-10 00:03:09,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:03:09,795 INFO L470 AbstractCegarLoop]: Abstraction has 10187 states and 11383 transitions. [2022-01-10 00:03:09,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.0) internal successors, (408), 3 states have internal predecessors, (408), 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 00:03:09,796 INFO L276 IsEmpty]: Start isEmpty. Operand 10187 states and 11383 transitions. [2022-01-10 00:03:09,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2022-01-10 00:03:09,813 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:03:09,813 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:03:09,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 00:03:09,813 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:03:09,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:03:09,814 INFO L85 PathProgramCache]: Analyzing trace with hash 132646832, now seen corresponding path program 1 times [2022-01-10 00:03:09,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:03:09,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140967952] [2022-01-10 00:03:09,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:03:09,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:03:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:03:09,976 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 607 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-01-10 00:03:09,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:03:09,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140967952] [2022-01-10 00:03:09,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140967952] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:03:09,977 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:03:09,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:03:09,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464324138] [2022-01-10 00:03:09,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:03:09,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:03:09,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:03:09,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:03:09,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:03:09,980 INFO L87 Difference]: Start difference. First operand 10187 states and 11383 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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 00:03:10,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:03:10,600 INFO L93 Difference]: Finished difference Result 20930 states and 23469 transitions. [2022-01-10 00:03:10,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:03:10,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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) Word has length 475 [2022-01-10 00:03:10,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:03:10,614 INFO L225 Difference]: With dead ends: 20930 [2022-01-10 00:03:10,614 INFO L226 Difference]: Without dead ends: 11297 [2022-01-10 00:03:10,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:03:10,623 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 84 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:03:10,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 353 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 00:03:10,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11297 states. [2022-01-10 00:03:10,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11297 to 10744. [2022-01-10 00:03:10,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10744 states, 10743 states have (on average 1.1144931583356605) internal successors, (11973), 10743 states have internal predecessors, (11973), 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 00:03:10,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10744 states to 10744 states and 11973 transitions. [2022-01-10 00:03:10,762 INFO L78 Accepts]: Start accepts. Automaton has 10744 states and 11973 transitions. Word has length 475 [2022-01-10 00:03:10,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:03:10,763 INFO L470 AbstractCegarLoop]: Abstraction has 10744 states and 11973 transitions. [2022-01-10 00:03:10,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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 00:03:10,763 INFO L276 IsEmpty]: Start isEmpty. Operand 10744 states and 11973 transitions. [2022-01-10 00:03:10,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2022-01-10 00:03:10,776 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:03:10,777 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:03:10,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 00:03:10,777 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:03:10,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:03:10,777 INFO L85 PathProgramCache]: Analyzing trace with hash -2079186287, now seen corresponding path program 1 times [2022-01-10 00:03:10,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:03:10,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858570408] [2022-01-10 00:03:10,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:03:10,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:03:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:03:10,993 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 0 proven. 304 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-01-10 00:03:10,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:03:10,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858570408] [2022-01-10 00:03:10,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858570408] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:03:10,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093794196] [2022-01-10 00:03:10,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:03:10,994 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:03:10,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:03:10,995 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 00:03:11,004 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 00:03:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:03:11,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 00:03:11,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:03:12,149 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-01-10 00:03:12,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:03:12,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093794196] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:03:12,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:03:12,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-01-10 00:03:12,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459165353] [2022-01-10 00:03:12,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:03:12,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:03:12,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:03:12,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:03:12,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:03:12,153 INFO L87 Difference]: Start difference. First operand 10744 states and 11973 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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 00:03:12,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:03:12,736 INFO L93 Difference]: Finished difference Result 22430 states and 25088 transitions. [2022-01-10 00:03:12,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:03:12,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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) Word has length 487 [2022-01-10 00:03:12,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:03:12,749 INFO L225 Difference]: With dead ends: 22430 [2022-01-10 00:03:12,749 INFO L226 Difference]: Without dead ends: 12240 [2022-01-10 00:03:12,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 486 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:03:12,758 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 113 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 00:03:12,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 318 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 00:03:12,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12240 states. [2022-01-10 00:03:12,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12240 to 11860. [2022-01-10 00:03:12,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11860 states, 11859 states have (on average 1.1160300193945527) internal successors, (13235), 11859 states have internal predecessors, (13235), 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 00:03:12,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11860 states to 11860 states and 13235 transitions. [2022-01-10 00:03:12,899 INFO L78 Accepts]: Start accepts. Automaton has 11860 states and 13235 transitions. Word has length 487 [2022-01-10 00:03:12,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:03:12,899 INFO L470 AbstractCegarLoop]: Abstraction has 11860 states and 13235 transitions. [2022-01-10 00:03:12,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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 00:03:12,900 INFO L276 IsEmpty]: Start isEmpty. Operand 11860 states and 13235 transitions. [2022-01-10 00:03:12,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2022-01-10 00:03:12,914 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:03:12,914 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:03:12,943 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 00:03:13,127 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,SelfDestructingSolverStorable15 [2022-01-10 00:03:13,128 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:03:13,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:03:13,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1008492538, now seen corresponding path program 1 times [2022-01-10 00:03:13,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:03:13,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591868599] [2022-01-10 00:03:13,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:03:13,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:03:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:03:13,307 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2022-01-10 00:03:13,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:03:13,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591868599] [2022-01-10 00:03:13,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591868599] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:03:13,307 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:03:13,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:03:13,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790579064] [2022-01-10 00:03:13,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:03:13,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:03:13,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:03:13,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:03:13,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:03:13,309 INFO L87 Difference]: Start difference. First operand 11860 states and 13235 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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 00:03:13,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:03:13,954 INFO L93 Difference]: Finished difference Result 25558 states and 28511 transitions. [2022-01-10 00:03:13,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:03:13,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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) Word has length 489 [2022-01-10 00:03:13,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:03:13,967 INFO L225 Difference]: With dead ends: 25558 [2022-01-10 00:03:13,967 INFO L226 Difference]: Without dead ends: 14068 [2022-01-10 00:03:13,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:03:13,975 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 106 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:03:13,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 362 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 00:03:13,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14068 states. [2022-01-10 00:03:14,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14068 to 13512. [2022-01-10 00:03:14,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13512 states, 13511 states have (on average 1.101398860187995) internal successors, (14881), 13511 states have internal predecessors, (14881), 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 00:03:14,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13512 states to 13512 states and 14881 transitions. [2022-01-10 00:03:14,123 INFO L78 Accepts]: Start accepts. Automaton has 13512 states and 14881 transitions. Word has length 489 [2022-01-10 00:03:14,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:03:14,124 INFO L470 AbstractCegarLoop]: Abstraction has 13512 states and 14881 transitions. [2022-01-10 00:03:14,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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 00:03:14,124 INFO L276 IsEmpty]: Start isEmpty. Operand 13512 states and 14881 transitions. [2022-01-10 00:03:14,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2022-01-10 00:03:14,142 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:03:14,142 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:03:14,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 00:03:14,142 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:03:14,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:03:14,143 INFO L85 PathProgramCache]: Analyzing trace with hash -2127881712, now seen corresponding path program 1 times [2022-01-10 00:03:14,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:03:14,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536723543] [2022-01-10 00:03:14,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:03:14,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:03:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:03:14,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 950 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-01-10 00:03:14,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:03:14,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536723543] [2022-01-10 00:03:14,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536723543] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:03:14,329 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:03:14,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 00:03:14,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137504393] [2022-01-10 00:03:14,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:03:14,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:03:14,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:03:14,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:03:14,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:03:14,331 INFO L87 Difference]: Start difference. First operand 13512 states and 14881 transitions. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 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 00:03:15,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:03:15,364 INFO L93 Difference]: Finished difference Result 32019 states and 35410 transitions. [2022-01-10 00:03:15,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:03:15,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 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) Word has length 562 [2022-01-10 00:03:15,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:03:15,389 INFO L225 Difference]: With dead ends: 32019 [2022-01-10 00:03:15,389 INFO L226 Difference]: Without dead ends: 19061 [2022-01-10 00:03:15,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:03:15,402 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 176 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 00:03:15,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 177 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 00:03:15,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19061 states. [2022-01-10 00:03:15,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19061 to 17019. [2022-01-10 00:03:15,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17019 states, 17018 states have (on average 1.0964860735691622) internal successors, (18660), 17018 states have internal predecessors, (18660), 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 00:03:15,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17019 states to 17019 states and 18660 transitions. [2022-01-10 00:03:15,624 INFO L78 Accepts]: Start accepts. Automaton has 17019 states and 18660 transitions. Word has length 562 [2022-01-10 00:03:15,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:03:15,624 INFO L470 AbstractCegarLoop]: Abstraction has 17019 states and 18660 transitions. [2022-01-10 00:03:15,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 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 00:03:15,625 INFO L276 IsEmpty]: Start isEmpty. Operand 17019 states and 18660 transitions. [2022-01-10 00:03:15,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2022-01-10 00:03:15,643 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:03:15,643 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:03:15,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 00:03:15,644 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:03:15,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:03:15,644 INFO L85 PathProgramCache]: Analyzing trace with hash 399883863, now seen corresponding path program 1 times [2022-01-10 00:03:15,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:03:15,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170304649] [2022-01-10 00:03:15,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:03:15,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:03:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:03:15,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1121 backedges. 759 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2022-01-10 00:03:15,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:03:15,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170304649] [2022-01-10 00:03:15,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170304649] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:03:15,830 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:03:15,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:03:15,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028217087] [2022-01-10 00:03:15,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:03:15,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:03:15,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:03:15,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:03:15,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:03:15,832 INFO L87 Difference]: Start difference. First operand 17019 states and 18660 transitions. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 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 00:03:16,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:03:16,947 INFO L93 Difference]: Finished difference Result 35886 states and 39369 transitions. [2022-01-10 00:03:16,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:03:16,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 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) Word has length 572 [2022-01-10 00:03:16,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:03:16,966 INFO L225 Difference]: With dead ends: 35886 [2022-01-10 00:03:16,966 INFO L226 Difference]: Without dead ends: 19237 [2022-01-10 00:03:16,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:03:16,980 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 181 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:03:16,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 109 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 00:03:16,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19237 states. [2022-01-10 00:03:17,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19237 to 18859. [2022-01-10 00:03:17,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18859 states, 18858 states have (on average 1.092586700604518) internal successors, (20604), 18858 states have internal predecessors, (20604), 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 00:03:17,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18859 states to 18859 states and 20604 transitions. [2022-01-10 00:03:17,207 INFO L78 Accepts]: Start accepts. Automaton has 18859 states and 20604 transitions. Word has length 572 [2022-01-10 00:03:17,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:03:17,207 INFO L470 AbstractCegarLoop]: Abstraction has 18859 states and 20604 transitions. [2022-01-10 00:03:17,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 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 00:03:17,208 INFO L276 IsEmpty]: Start isEmpty. Operand 18859 states and 20604 transitions. [2022-01-10 00:03:17,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2022-01-10 00:03:17,224 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:03:17,224 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:03:17,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 00:03:17,224 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:03:17,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:03:17,225 INFO L85 PathProgramCache]: Analyzing trace with hash 2124046520, now seen corresponding path program 1 times [2022-01-10 00:03:17,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:03:17,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140419020] [2022-01-10 00:03:17,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:03:17,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:03:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:03:17,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 917 proven. 0 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2022-01-10 00:03:17,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:03:17,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140419020] [2022-01-10 00:03:17,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140419020] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:03:17,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:03:17,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:03:17,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112970949] [2022-01-10 00:03:17,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:03:17,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:03:17,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:03:17,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:03:17,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:03:17,401 INFO L87 Difference]: Start difference. First operand 18859 states and 20604 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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 00:03:18,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:03:18,041 INFO L93 Difference]: Finished difference Result 38819 states and 42488 transitions. [2022-01-10 00:03:18,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:03:18,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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) Word has length 660 [2022-01-10 00:03:18,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:03:18,063 INFO L225 Difference]: With dead ends: 38819 [2022-01-10 00:03:18,063 INFO L226 Difference]: Without dead ends: 19960 [2022-01-10 00:03:18,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:03:18,075 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 193 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 00:03:18,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 351 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 00:03:18,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19960 states. [2022-01-10 00:03:18,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19960 to 19406. [2022-01-10 00:03:18,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19406 states, 19405 states have (on average 1.0824014429270807) internal successors, (21004), 19405 states have internal predecessors, (21004), 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 00:03:18,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19406 states to 19406 states and 21004 transitions. [2022-01-10 00:03:18,360 INFO L78 Accepts]: Start accepts. Automaton has 19406 states and 21004 transitions. Word has length 660 [2022-01-10 00:03:18,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:03:18,360 INFO L470 AbstractCegarLoop]: Abstraction has 19406 states and 21004 transitions. [2022-01-10 00:03:18,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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 00:03:18,360 INFO L276 IsEmpty]: Start isEmpty. Operand 19406 states and 21004 transitions. [2022-01-10 00:03:18,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 726 [2022-01-10 00:03:18,381 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:03:18,382 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:03:18,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 00:03:18,382 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:03:18,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:03:18,383 INFO L85 PathProgramCache]: Analyzing trace with hash 456496721, now seen corresponding path program 1 times [2022-01-10 00:03:18,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:03:18,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060789516] [2022-01-10 00:03:18,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:03:18,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:03:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:03:18,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2030 backedges. 1651 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2022-01-10 00:03:18,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:03:18,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060789516] [2022-01-10 00:03:18,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060789516] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:03:18,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:03:18,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 00:03:18,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865419793] [2022-01-10 00:03:18,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:03:18,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:03:18,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:03:18,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:03:18,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:03:18,721 INFO L87 Difference]: Start difference. First operand 19406 states and 21004 transitions. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 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 00:03:19,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:03:19,635 INFO L93 Difference]: Finished difference Result 40667 states and 43981 transitions. [2022-01-10 00:03:19,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:03:19,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 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) Word has length 725 [2022-01-10 00:03:19,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:03:19,658 INFO L225 Difference]: With dead ends: 40667 [2022-01-10 00:03:19,658 INFO L226 Difference]: Without dead ends: 21631 [2022-01-10 00:03:19,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:03:19,670 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 177 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 00:03:19,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 166 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 00:03:19,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21631 states. [2022-01-10 00:03:19,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21631 to 19406. [2022-01-10 00:03:19,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19406 states, 19405 states have (on average 1.0824014429270807) internal successors, (21004), 19405 states have internal predecessors, (21004), 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 00:03:19,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19406 states to 19406 states and 21004 transitions. [2022-01-10 00:03:19,954 INFO L78 Accepts]: Start accepts. Automaton has 19406 states and 21004 transitions. Word has length 725 [2022-01-10 00:03:19,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:03:19,955 INFO L470 AbstractCegarLoop]: Abstraction has 19406 states and 21004 transitions. [2022-01-10 00:03:19,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 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 00:03:19,955 INFO L276 IsEmpty]: Start isEmpty. Operand 19406 states and 21004 transitions. [2022-01-10 00:03:19,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2022-01-10 00:03:19,975 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:03:19,975 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:03:19,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 00:03:19,975 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:03:19,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:03:19,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1541384588, now seen corresponding path program 1 times [2022-01-10 00:03:19,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:03:19,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370107825] [2022-01-10 00:03:19,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:03:19,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:03:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:03:20,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1690 backedges. 999 proven. 8 refuted. 0 times theorem prover too weak. 683 trivial. 0 not checked. [2022-01-10 00:03:20,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:03:20,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370107825] [2022-01-10 00:03:20,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370107825] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:03:20,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368619212] [2022-01-10 00:03:20,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:03:20,446 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:03:20,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:03:20,452 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 00:03:20,453 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 00:03:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:03:20,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 00:03:20,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:03:21,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1690 backedges. 683 proven. 0 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2022-01-10 00:03:21,933 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:03:21,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368619212] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:03:21,933 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:03:21,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2022-01-10 00:03:21,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714576285] [2022-01-10 00:03:21,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:03:21,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:03:21,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:03:21,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:03:21,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-10 00:03:21,935 INFO L87 Difference]: Start difference. First operand 19406 states and 21004 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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 00:03:22,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:03:22,458 INFO L93 Difference]: Finished difference Result 40659 states and 44021 transitions. [2022-01-10 00:03:22,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:03:22,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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) Word has length 733 [2022-01-10 00:03:22,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:03:22,480 INFO L225 Difference]: With dead ends: 40659 [2022-01-10 00:03:22,480 INFO L226 Difference]: Without dead ends: 21623 [2022-01-10 00:03:22,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 732 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-10 00:03:22,493 INFO L933 BasicCegarLoop]: 322 mSDtfsCounter, 99 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 00:03:22,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 341 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 00:03:22,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21623 states. [2022-01-10 00:03:22,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21623 to 20510. [2022-01-10 00:03:22,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20510 states, 20509 states have (on average 1.082207811204837) internal successors, (22195), 20509 states have internal predecessors, (22195), 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 00:03:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20510 states to 20510 states and 22195 transitions. [2022-01-10 00:03:22,686 INFO L78 Accepts]: Start accepts. Automaton has 20510 states and 22195 transitions. Word has length 733 [2022-01-10 00:03:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:03:22,687 INFO L470 AbstractCegarLoop]: Abstraction has 20510 states and 22195 transitions. [2022-01-10 00:03:22,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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 00:03:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 20510 states and 22195 transitions. [2022-01-10 00:03:22,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 864 [2022-01-10 00:03:22,705 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:03:22,706 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:03:22,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 00:03:22,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:03:22,907 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:03:22,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:03:22,907 INFO L85 PathProgramCache]: Analyzing trace with hash 747293827, now seen corresponding path program 1 times [2022-01-10 00:03:22,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:03:22,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912920323] [2022-01-10 00:03:22,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:03:22,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:03:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:03:23,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2389 backedges. 1245 proven. 428 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2022-01-10 00:03:23,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:03:23,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912920323] [2022-01-10 00:03:23,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912920323] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:03:23,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320452352] [2022-01-10 00:03:23,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:03:23,551 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:03:23,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:03:23,556 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 00:03:23,558 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 00:03:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:03:23,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 1115 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 00:03:23,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:03:25,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2389 backedges. 1382 proven. 0 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2022-01-10 00:03:25,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:03:25,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320452352] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:03:25,108 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:03:25,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 15 [2022-01-10 00:03:25,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761625824] [2022-01-10 00:03:25,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:03:25,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:03:25,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:03:25,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:03:25,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-01-10 00:03:25,112 INFO L87 Difference]: Start difference. First operand 20510 states and 22195 transitions. Second operand has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 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 00:03:25,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:03:25,870 INFO L93 Difference]: Finished difference Result 44148 states and 47734 transitions. [2022-01-10 00:03:25,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:03:25,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 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) Word has length 863 [2022-01-10 00:03:25,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:03:25,896 INFO L225 Difference]: With dead ends: 44148 [2022-01-10 00:03:25,896 INFO L226 Difference]: Without dead ends: 24008 [2022-01-10 00:03:25,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 874 GetRequests, 861 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-01-10 00:03:25,911 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 165 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:03:25,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 148 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 00:03:26,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24008 states. [2022-01-10 00:03:26,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24008 to 20142. [2022-01-10 00:03:26,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20142 states, 20141 states have (on average 1.081574896976317) internal successors, (21784), 20141 states have internal predecessors, (21784), 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 00:03:26,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20142 states to 20142 states and 21784 transitions. [2022-01-10 00:03:26,254 INFO L78 Accepts]: Start accepts. Automaton has 20142 states and 21784 transitions. Word has length 863 [2022-01-10 00:03:26,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:03:26,255 INFO L470 AbstractCegarLoop]: Abstraction has 20142 states and 21784 transitions. [2022-01-10 00:03:26,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 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 00:03:26,255 INFO L276 IsEmpty]: Start isEmpty. Operand 20142 states and 21784 transitions. [2022-01-10 00:03:26,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 874 [2022-01-10 00:03:26,285 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:03:26,286 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:03:26,304 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 00:03:26,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:03:26,488 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:03:26,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:03:26,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1448162269, now seen corresponding path program 1 times [2022-01-10 00:03:26,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:03:26,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888756690] [2022-01-10 00:03:26,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:03:26,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:03:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:03:27,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2399 backedges. 1032 proven. 651 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2022-01-10 00:03:27,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:03:27,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888756690] [2022-01-10 00:03:27,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888756690] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:03:27,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366936544] [2022-01-10 00:03:27,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:03:27,061 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:03:27,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:03:27,062 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 00:03:27,087 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 00:03:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:03:27,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 00:03:27,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:03:28,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2399 backedges. 815 proven. 0 refuted. 0 times theorem prover too weak. 1584 trivial. 0 not checked. [2022-01-10 00:03:28,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:03:28,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366936544] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:03:28,517 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:03:28,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-01-10 00:03:28,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771878305] [2022-01-10 00:03:28,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:03:28,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:03:28,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:03:28,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:03:28,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-01-10 00:03:28,519 INFO L87 Difference]: Start difference. First operand 20142 states and 21784 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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 00:03:29,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:03:29,151 INFO L93 Difference]: Finished difference Result 41207 states and 44536 transitions. [2022-01-10 00:03:29,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:03:29,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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) Word has length 873 [2022-01-10 00:03:29,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:03:29,181 INFO L225 Difference]: With dead ends: 41207 [2022-01-10 00:03:29,181 INFO L226 Difference]: Without dead ends: 21435 [2022-01-10 00:03:29,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 882 GetRequests, 873 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-01-10 00:03:29,196 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 98 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 00:03:29,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 348 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 00:03:29,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21435 states. [2022-01-10 00:03:29,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21435 to 19958. [2022-01-10 00:03:29,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19958 states, 19957 states have (on average 1.0793205391591922) internal successors, (21540), 19957 states have internal predecessors, (21540), 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 00:03:29,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19958 states to 19958 states and 21540 transitions. [2022-01-10 00:03:29,459 INFO L78 Accepts]: Start accepts. Automaton has 19958 states and 21540 transitions. Word has length 873 [2022-01-10 00:03:29,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:03:29,460 INFO L470 AbstractCegarLoop]: Abstraction has 19958 states and 21540 transitions. [2022-01-10 00:03:29,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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 00:03:29,460 INFO L276 IsEmpty]: Start isEmpty. Operand 19958 states and 21540 transitions. [2022-01-10 00:03:29,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 935 [2022-01-10 00:03:29,477 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:03:29,478 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:03:29,496 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 00:03:29,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-01-10 00:03:29,680 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:03:29,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:03:29,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1116372708, now seen corresponding path program 1 times [2022-01-10 00:03:29,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:03:29,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619320712] [2022-01-10 00:03:29,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:03:29,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:03:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:03:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2976 backedges. 1385 proven. 0 refuted. 0 times theorem prover too weak. 1591 trivial. 0 not checked. [2022-01-10 00:03:29,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:03:29,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619320712] [2022-01-10 00:03:29,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619320712] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:03:29,994 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:03:29,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:03:29,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341676566] [2022-01-10 00:03:29,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:03:29,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:03:29,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:03:29,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:03:29,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:03:29,996 INFO L87 Difference]: Start difference. First operand 19958 states and 21540 transitions. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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 00:03:30,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:03:30,603 INFO L93 Difference]: Finished difference Result 38077 states and 41065 transitions. [2022-01-10 00:03:30,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:03:30,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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) Word has length 934 [2022-01-10 00:03:30,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:03:30,604 INFO L225 Difference]: With dead ends: 38077 [2022-01-10 00:03:30,604 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 00:03:30,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:03:30,617 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 110 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 00:03:30,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 346 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 00:03:30,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 00:03:30,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 00:03:30,618 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 00:03:30,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 00:03:30,618 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 934 [2022-01-10 00:03:30,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:03:30,618 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 00:03:30,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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 00:03:30,618 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 00:03:30,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 00:03:30,622 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 00:03:30,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 00:03:30,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 00:03:40,330 INFO L858 garLoopResultBuilder]: For program point L498(lines 498 509) no Hoare annotation was computed. [2022-01-10 00:03:40,330 INFO L858 garLoopResultBuilder]: For program point L432(lines 432 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,330 INFO L858 garLoopResultBuilder]: For program point L498-2(lines 498 509) no Hoare annotation was computed. [2022-01-10 00:03:40,330 INFO L858 garLoopResultBuilder]: For program point L168-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,330 INFO L858 garLoopResultBuilder]: For program point L102-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,330 INFO L858 garLoopResultBuilder]: For program point L36-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,330 INFO L858 garLoopResultBuilder]: For program point L1027(lines 1027 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,330 INFO L858 garLoopResultBuilder]: For program point L631(lines 631 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,330 INFO L858 garLoopResultBuilder]: For program point L565(lines 565 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,331 INFO L858 garLoopResultBuilder]: For program point L169(line 169) no Hoare annotation was computed. [2022-01-10 00:03:40,331 INFO L858 garLoopResultBuilder]: For program point L103(line 103) no Hoare annotation was computed. [2022-01-10 00:03:40,331 INFO L858 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-01-10 00:03:40,331 INFO L858 garLoopResultBuilder]: For program point L896(lines 896 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,331 INFO L858 garLoopResultBuilder]: For program point L698(lines 698 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,331 INFO L858 garLoopResultBuilder]: For program point L368(lines 368 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,331 INFO L858 garLoopResultBuilder]: For program point L963(lines 963 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,331 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,331 INFO L858 garLoopResultBuilder]: For program point L171-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,331 INFO L858 garLoopResultBuilder]: For program point L105-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,331 INFO L858 garLoopResultBuilder]: For program point L39-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,331 INFO L858 garLoopResultBuilder]: For program point L832(lines 832 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,332 INFO L858 garLoopResultBuilder]: For program point L304(lines 304 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,332 INFO L858 garLoopResultBuilder]: For program point L172(line 172) no Hoare annotation was computed. [2022-01-10 00:03:40,332 INFO L858 garLoopResultBuilder]: For program point L106(line 106) no Hoare annotation was computed. [2022-01-10 00:03:40,332 INFO L858 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2022-01-10 00:03:40,332 INFO L858 garLoopResultBuilder]: For program point L767(lines 767 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,332 INFO L858 garLoopResultBuilder]: For program point L768(lines 768 778) no Hoare annotation was computed. [2022-01-10 00:03:40,332 INFO L858 garLoopResultBuilder]: For program point L768-2(lines 768 778) no Hoare annotation was computed. [2022-01-10 00:03:40,332 INFO L858 garLoopResultBuilder]: For program point L174-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,332 INFO L858 garLoopResultBuilder]: For program point L108-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,332 INFO L858 garLoopResultBuilder]: For program point L42-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,332 INFO L858 garLoopResultBuilder]: For program point L835(lines 835 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,332 INFO L858 garLoopResultBuilder]: For program point L571(lines 571 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,332 INFO L858 garLoopResultBuilder]: For program point L439(lines 439 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,332 INFO L858 garLoopResultBuilder]: For program point L175(line 175) no Hoare annotation was computed. [2022-01-10 00:03:40,332 INFO L858 garLoopResultBuilder]: For program point L109(line 109) no Hoare annotation was computed. [2022-01-10 00:03:40,332 INFO L858 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-01-10 00:03:40,333 INFO L858 garLoopResultBuilder]: For program point L968(lines 968 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,333 INFO L858 garLoopResultBuilder]: For program point L704(lines 704 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,333 INFO L858 garLoopResultBuilder]: For program point L638(lines 638 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,333 INFO L854 garLoopResultBuilder]: At program point L1035(lines 32 1036) the Hoare annotation is: (let ((.cse1 (= ~a25~0 11)) (.cse5 (= ~a25~0 13)) (.cse8 (<= ~a23~0 138)) (.cse4 (<= ~a23~0 312)) (.cse7 (= ~a4~0 0)) (.cse9 (<= ~a25~0 10)) (.cse6 (= ~a25~0 12)) (.cse0 (<= (div (div ~a23~0 5) 5) 127750)) (.cse2 (<= 141 ~a29~0)) (.cse3 (= ~a4~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= ~a25~0 9) .cse3 .cse4) (and .cse1 .cse3 .cse4) (and .cse5 (<= ~a29~0 220) .cse3 .cse4) (and (or .cse6 .cse1) .cse0 (<= (+ 28470 ~a29~0) 0) .cse3) (and .cse5 .cse7 .cse8) (and .cse5 (<= ~a29~0 245) .cse2 .cse3) (and .cse6 .cse0 .cse7) (and .cse5 (<= 261 ~a29~0) .cse3 .cse4) (and .cse7 .cse1 .cse8) (and .cse5 .cse0 .cse3 (not (<= ~a23~0 306))) (and .cse1 (< 277 ~a29~0) .cse3) (and .cse5 .cse8 .cse3) (and .cse0 .cse9 (< 306 ~a23~0) .cse3) (and .cse6 .cse3 .cse4) (and .cse6 .cse7 (<= (+ ~a29~0 554036) 0)) (and (not (< 138 ~a23~0)) .cse9 .cse3) (and .cse6 .cse7 .cse2) (and .cse0 .cse7 .cse9) (and .cse9 .cse2 .cse3) (and .cse6 .cse0 .cse2 .cse3))) [2022-01-10 00:03:40,333 INFO L858 garLoopResultBuilder]: For program point L903(lines 903 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,333 INFO L858 garLoopResultBuilder]: For program point L705(lines 705 715) no Hoare annotation was computed. [2022-01-10 00:03:40,333 INFO L858 garLoopResultBuilder]: For program point L705-2(lines 705 715) no Hoare annotation was computed. [2022-01-10 00:03:40,333 INFO L858 garLoopResultBuilder]: For program point L375(lines 375 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,333 INFO L858 garLoopResultBuilder]: For program point L309(lines 309 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,333 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,333 INFO L858 garLoopResultBuilder]: For program point L177-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,333 INFO L858 garLoopResultBuilder]: For program point L111-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,334 INFO L858 garLoopResultBuilder]: For program point L45-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,334 INFO L858 garLoopResultBuilder]: For program point L178(line 178) no Hoare annotation was computed. [2022-01-10 00:03:40,334 INFO L858 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2022-01-10 00:03:40,334 INFO L858 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-01-10 00:03:40,334 INFO L861 garLoopResultBuilder]: At program point L1038(lines 1038 1054) the Hoare annotation is: true [2022-01-10 00:03:40,334 INFO L858 garLoopResultBuilder]: For program point L576(lines 576 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,334 INFO L858 garLoopResultBuilder]: For program point L510(lines 510 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,334 INFO L858 garLoopResultBuilder]: For program point L180-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,334 INFO L858 garLoopResultBuilder]: For program point L114-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,334 INFO L858 garLoopResultBuilder]: For program point L48-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,334 INFO L858 garLoopResultBuilder]: For program point L973(lines 973 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,334 INFO L858 garLoopResultBuilder]: For program point L841(lines 841 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,334 INFO L858 garLoopResultBuilder]: For program point L181(line 181) no Hoare annotation was computed. [2022-01-10 00:03:40,334 INFO L858 garLoopResultBuilder]: For program point L115(line 115) no Hoare annotation was computed. [2022-01-10 00:03:40,334 INFO L858 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2022-01-10 00:03:40,334 INFO L858 garLoopResultBuilder]: For program point L908(lines 908 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,334 INFO L858 garLoopResultBuilder]: For program point L446(lines 446 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,334 INFO L858 garLoopResultBuilder]: For program point L380(lines 380 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,334 INFO L858 garLoopResultBuilder]: For program point L645(lines 645 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,334 INFO L858 garLoopResultBuilder]: For program point L315(lines 315 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,334 INFO L858 garLoopResultBuilder]: For program point L183-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,334 INFO L858 garLoopResultBuilder]: For program point L117-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,334 INFO L858 garLoopResultBuilder]: For program point L51-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,335 INFO L858 garLoopResultBuilder]: For program point L250(lines 250 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,335 INFO L858 garLoopResultBuilder]: For program point L184(line 184) no Hoare annotation was computed. [2022-01-10 00:03:40,335 INFO L858 garLoopResultBuilder]: For program point L118(line 118) no Hoare annotation was computed. [2022-01-10 00:03:40,335 INFO L858 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2022-01-10 00:03:40,335 INFO L858 garLoopResultBuilder]: For program point L779(lines 779 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,335 INFO L854 garLoopResultBuilder]: At program point L1044-2(lines 1044 1053) the Hoare annotation is: (let ((.cse1 (= ~a25~0 11)) (.cse5 (= ~a25~0 13)) (.cse8 (<= ~a23~0 138)) (.cse4 (<= ~a23~0 312)) (.cse7 (= ~a4~0 0)) (.cse9 (<= ~a25~0 10)) (.cse6 (= ~a25~0 12)) (.cse0 (<= (div (div ~a23~0 5) 5) 127750)) (.cse2 (<= 141 ~a29~0)) (.cse3 (= ~a4~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= ~a25~0 9) .cse3 .cse4) (and .cse1 .cse3 .cse4) (and .cse5 (<= ~a29~0 220) .cse3 .cse4) (and (or .cse6 .cse1) .cse0 (<= (+ 28470 ~a29~0) 0) .cse3) (and .cse5 .cse7 .cse8) (and .cse5 (<= ~a29~0 245) .cse2 .cse3) (and .cse6 .cse0 .cse7) (and .cse5 (<= 261 ~a29~0) .cse3 .cse4) (and .cse7 .cse1 .cse8) (and .cse5 .cse0 .cse3 (not (<= ~a23~0 306))) (and .cse1 (< 277 ~a29~0) .cse3) (and .cse5 .cse8 .cse3) (and .cse0 .cse9 (< 306 ~a23~0) .cse3) (and .cse6 .cse3 .cse4) (and .cse6 .cse7 (<= (+ ~a29~0 554036) 0)) (and (not (< 138 ~a23~0)) .cse9 .cse3) (and .cse6 .cse7 .cse2) (and .cse0 .cse7 .cse9) (and .cse9 .cse2 .cse3) (and .cse6 .cse0 .cse2 .cse3))) [2022-01-10 00:03:40,335 INFO L858 garLoopResultBuilder]: For program point L846(lines 846 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,335 INFO L858 garLoopResultBuilder]: For program point L582(lines 582 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,335 INFO L858 garLoopResultBuilder]: For program point L186-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,335 INFO L858 garLoopResultBuilder]: For program point L120-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,335 INFO L858 garLoopResultBuilder]: For program point L54-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,335 INFO L858 garLoopResultBuilder]: For program point L979(lines 979 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,336 INFO L858 garLoopResultBuilder]: For program point L913(lines 913 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,336 INFO L858 garLoopResultBuilder]: For program point L517(lines 517 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,336 INFO L858 garLoopResultBuilder]: For program point L187(line 187) no Hoare annotation was computed. [2022-01-10 00:03:40,336 INFO L858 garLoopResultBuilder]: For program point L121(line 121) no Hoare annotation was computed. [2022-01-10 00:03:40,336 INFO L858 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2022-01-10 00:03:40,336 INFO L858 garLoopResultBuilder]: For program point L980(lines 980 990) no Hoare annotation was computed. [2022-01-10 00:03:40,336 INFO L858 garLoopResultBuilder]: For program point L914(lines 914 924) no Hoare annotation was computed. [2022-01-10 00:03:40,336 INFO L858 garLoopResultBuilder]: For program point L980-2(lines 980 990) no Hoare annotation was computed. [2022-01-10 00:03:40,336 INFO L858 garLoopResultBuilder]: For program point L914-2(lines 914 924) no Hoare annotation was computed. [2022-01-10 00:03:40,336 INFO L858 garLoopResultBuilder]: For program point L716(lines 716 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,336 INFO L858 garLoopResultBuilder]: For program point L320(lines 320 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,336 INFO L858 garLoopResultBuilder]: For program point L585(lines 585 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,336 INFO L858 garLoopResultBuilder]: For program point L453(lines 453 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,336 INFO L858 garLoopResultBuilder]: For program point L387(lines 387 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,336 INFO L858 garLoopResultBuilder]: For program point L189-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,336 INFO L858 garLoopResultBuilder]: For program point L123-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,337 INFO L858 garLoopResultBuilder]: For program point L57-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,337 INFO L858 garLoopResultBuilder]: For program point L784(lines 784 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,337 INFO L858 garLoopResultBuilder]: For program point L652(lines 652 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,337 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 00:03:40,337 INFO L858 garLoopResultBuilder]: For program point L190(line 190) no Hoare annotation was computed. [2022-01-10 00:03:40,337 INFO L858 garLoopResultBuilder]: For program point L124(line 124) no Hoare annotation was computed. [2022-01-10 00:03:40,337 INFO L858 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2022-01-10 00:03:40,337 INFO L858 garLoopResultBuilder]: For program point L1049(line 1049) no Hoare annotation was computed. [2022-01-10 00:03:40,337 INFO L858 garLoopResultBuilder]: For program point L851(lines 851 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,337 INFO L858 garLoopResultBuilder]: For program point L257(lines 257 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,337 INFO L858 garLoopResultBuilder]: For program point L192-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,337 INFO L858 garLoopResultBuilder]: For program point L126-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,337 INFO L858 garLoopResultBuilder]: For program point L60-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,337 INFO L858 garLoopResultBuilder]: For program point L193(line 193) no Hoare annotation was computed. [2022-01-10 00:03:40,337 INFO L858 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2022-01-10 00:03:40,338 INFO L858 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2022-01-10 00:03:40,338 INFO L858 garLoopResultBuilder]: For program point L722(lines 722 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,338 INFO L858 garLoopResultBuilder]: For program point L524(lines 524 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,338 INFO L858 garLoopResultBuilder]: For program point L657(lines 657 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,338 INFO L858 garLoopResultBuilder]: For program point L591(lines 591 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,338 INFO L858 garLoopResultBuilder]: For program point L525(lines 525 535) no Hoare annotation was computed. [2022-01-10 00:03:40,338 INFO L858 garLoopResultBuilder]: For program point L525-2(lines 525 535) no Hoare annotation was computed. [2022-01-10 00:03:40,338 INFO L858 garLoopResultBuilder]: For program point L327(lines 327 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,338 INFO L858 garLoopResultBuilder]: For program point L195-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,338 INFO L858 garLoopResultBuilder]: For program point L129-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,338 INFO L858 garLoopResultBuilder]: For program point L63-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,338 INFO L858 garLoopResultBuilder]: For program point L856(lines 856 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,338 INFO L858 garLoopResultBuilder]: For program point L790(lines 790 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,338 INFO L858 garLoopResultBuilder]: For program point L658(lines 658 667) no Hoare annotation was computed. [2022-01-10 00:03:40,338 INFO L858 garLoopResultBuilder]: For program point L658-2(lines 658 667) no Hoare annotation was computed. [2022-01-10 00:03:40,338 INFO L858 garLoopResultBuilder]: For program point L460(lines 460 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,339 INFO L858 garLoopResultBuilder]: For program point L394(lines 394 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,339 INFO L858 garLoopResultBuilder]: For program point L196(line 196) no Hoare annotation was computed. [2022-01-10 00:03:40,339 INFO L858 garLoopResultBuilder]: For program point L130(line 130) no Hoare annotation was computed. [2022-01-10 00:03:40,339 INFO L858 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2022-01-10 00:03:40,339 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 00:03:40,339 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 148) no Hoare annotation was computed. [2022-01-10 00:03:40,339 INFO L858 garLoopResultBuilder]: For program point L264(lines 264 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,339 INFO L858 garLoopResultBuilder]: For program point L198-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,339 INFO L858 garLoopResultBuilder]: For program point L132-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,339 INFO L858 garLoopResultBuilder]: For program point L66-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,339 INFO L858 garLoopResultBuilder]: For program point L991(lines 991 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,339 INFO L858 garLoopResultBuilder]: For program point L925(lines 925 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,339 INFO L858 garLoopResultBuilder]: For program point L727(lines 727 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,339 INFO L858 garLoopResultBuilder]: For program point L199(line 199) no Hoare annotation was computed. [2022-01-10 00:03:40,339 INFO L858 garLoopResultBuilder]: For program point L133(line 133) no Hoare annotation was computed. [2022-01-10 00:03:40,340 INFO L858 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2022-01-10 00:03:40,340 INFO L858 garLoopResultBuilder]: For program point L926(lines 926 936) no Hoare annotation was computed. [2022-01-10 00:03:40,340 INFO L858 garLoopResultBuilder]: For program point L926-2(lines 926 936) no Hoare annotation was computed. [2022-01-10 00:03:40,340 INFO L858 garLoopResultBuilder]: For program point L728(lines 728 740) no Hoare annotation was computed. [2022-01-10 00:03:40,340 INFO L858 garLoopResultBuilder]: For program point L728-2(lines 728 740) no Hoare annotation was computed. [2022-01-10 00:03:40,340 INFO L858 garLoopResultBuilder]: For program point L596(lines 596 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,340 INFO L858 garLoopResultBuilder]: For program point L332(lines 332 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,340 INFO L858 garLoopResultBuilder]: For program point L597(lines 597 607) no Hoare annotation was computed. [2022-01-10 00:03:40,340 INFO L858 garLoopResultBuilder]: For program point L597-2(lines 597 607) no Hoare annotation was computed. [2022-01-10 00:03:40,340 INFO L858 garLoopResultBuilder]: For program point L201-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,340 INFO L858 garLoopResultBuilder]: For program point L135-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,340 INFO L858 garLoopResultBuilder]: For program point L69-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,340 INFO L858 garLoopResultBuilder]: For program point L862(lines 862 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,340 INFO L858 garLoopResultBuilder]: For program point L466(lines 466 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,340 INFO L858 garLoopResultBuilder]: For program point L202(line 202) no Hoare annotation was computed. [2022-01-10 00:03:40,340 INFO L858 garLoopResultBuilder]: For program point L136(line 136) no Hoare annotation was computed. [2022-01-10 00:03:40,341 INFO L858 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2022-01-10 00:03:40,341 INFO L858 garLoopResultBuilder]: For program point L797(lines 797 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,341 INFO L858 garLoopResultBuilder]: For program point L401(lines 401 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,341 INFO L858 garLoopResultBuilder]: For program point L270(lines 270 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,341 INFO L858 garLoopResultBuilder]: For program point L204-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,341 INFO L858 garLoopResultBuilder]: For program point L138-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,341 INFO L858 garLoopResultBuilder]: For program point L72-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,341 INFO L858 garLoopResultBuilder]: For program point L205(line 205) no Hoare annotation was computed. [2022-01-10 00:03:40,341 INFO L858 garLoopResultBuilder]: For program point L139(line 139) no Hoare annotation was computed. [2022-01-10 00:03:40,341 INFO L858 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2022-01-10 00:03:40,341 INFO L858 garLoopResultBuilder]: For program point L998(lines 998 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,341 INFO L858 garLoopResultBuilder]: For program point L668(lines 668 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,341 INFO L858 garLoopResultBuilder]: For program point L536(lines 536 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,341 INFO L858 garLoopResultBuilder]: For program point L339(lines 339 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,341 INFO L858 garLoopResultBuilder]: For program point L207-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,341 INFO L858 garLoopResultBuilder]: For program point L141-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,341 INFO L858 garLoopResultBuilder]: For program point L75-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,342 INFO L858 garLoopResultBuilder]: For program point L802(lines 802 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,342 INFO L858 garLoopResultBuilder]: For program point L208(line 208) no Hoare annotation was computed. [2022-01-10 00:03:40,342 INFO L858 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2022-01-10 00:03:40,342 INFO L858 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2022-01-10 00:03:40,342 INFO L858 garLoopResultBuilder]: For program point L869(lines 869 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,342 INFO L858 garLoopResultBuilder]: For program point L473(lines 473 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,342 INFO L858 garLoopResultBuilder]: For program point L275(lines 275 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,342 INFO L858 garLoopResultBuilder]: For program point L408(lines 408 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,342 INFO L858 garLoopResultBuilder]: For program point L210-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,342 INFO L858 garLoopResultBuilder]: For program point L144-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,342 INFO L858 garLoopResultBuilder]: For program point L78-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,342 INFO L858 garLoopResultBuilder]: For program point L1003(lines 1003 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,342 INFO L858 garLoopResultBuilder]: For program point L937(lines 937 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,342 INFO L858 garLoopResultBuilder]: For program point L673(lines 673 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,342 INFO L858 garLoopResultBuilder]: For program point L541(lines 541 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,342 INFO L858 garLoopResultBuilder]: For program point L409(lines 409 420) no Hoare annotation was computed. [2022-01-10 00:03:40,342 INFO L858 garLoopResultBuilder]: For program point L409-2(lines 409 420) no Hoare annotation was computed. [2022-01-10 00:03:40,343 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-01-10 00:03:40,343 INFO L858 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-01-10 00:03:40,343 INFO L858 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2022-01-10 00:03:40,343 INFO L858 garLoopResultBuilder]: For program point L608(lines 608 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,343 INFO L858 garLoopResultBuilder]: For program point L344(lines 344 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,343 INFO L858 garLoopResultBuilder]: For program point L278(lines 278 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,343 INFO L858 garLoopResultBuilder]: For program point L741(lines 741 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,343 INFO L858 garLoopResultBuilder]: For program point L213-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,343 INFO L858 garLoopResultBuilder]: For program point L147-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,343 INFO L858 garLoopResultBuilder]: For program point L81-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,343 INFO L858 garLoopResultBuilder]: For program point L214(line 214) no Hoare annotation was computed. [2022-01-10 00:03:40,343 INFO L858 garLoopResultBuilder]: For program point L148(line 148) no Hoare annotation was computed. [2022-01-10 00:03:40,343 INFO L858 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2022-01-10 00:03:40,343 INFO L858 garLoopResultBuilder]: For program point L875(lines 875 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,343 INFO L858 garLoopResultBuilder]: For program point L809(lines 809 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,344 INFO L858 garLoopResultBuilder]: For program point L942(lines 942 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,344 INFO L858 garLoopResultBuilder]: For program point L876(lines 876 885) no Hoare annotation was computed. [2022-01-10 00:03:40,344 INFO L858 garLoopResultBuilder]: For program point L876-2(lines 876 885) no Hoare annotation was computed. [2022-01-10 00:03:40,344 INFO L858 garLoopResultBuilder]: For program point L480(lines 480 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,344 INFO L858 garLoopResultBuilder]: For program point L150-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,344 INFO L858 garLoopResultBuilder]: For program point L84-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,344 INFO L858 garLoopResultBuilder]: For program point L613(lines 613 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,344 INFO L858 garLoopResultBuilder]: For program point L547(lines 547 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,344 INFO L858 garLoopResultBuilder]: For program point L151(line 151) no Hoare annotation was computed. [2022-01-10 00:03:40,344 INFO L858 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-01-10 00:03:40,344 INFO L858 garLoopResultBuilder]: For program point L1010(lines 1010 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,344 INFO L858 garLoopResultBuilder]: For program point L680(lines 680 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,344 INFO L858 garLoopResultBuilder]: For program point L614(lines 614 624) no Hoare annotation was computed. [2022-01-10 00:03:40,344 INFO L858 garLoopResultBuilder]: For program point L614-2(lines 614 624) no Hoare annotation was computed. [2022-01-10 00:03:40,344 INFO L858 garLoopResultBuilder]: For program point L350(lines 350 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,344 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 00:03:40,344 INFO L858 garLoopResultBuilder]: For program point L285(lines 285 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,345 INFO L858 garLoopResultBuilder]: For program point L153-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,345 INFO L858 garLoopResultBuilder]: For program point L87-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,345 INFO L858 garLoopResultBuilder]: For program point L814(lines 814 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,345 INFO L858 garLoopResultBuilder]: For program point L748(lines 748 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,345 INFO L858 garLoopResultBuilder]: For program point L154(line 154) no Hoare annotation was computed. [2022-01-10 00:03:40,345 INFO L858 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2022-01-10 00:03:40,345 INFO L858 garLoopResultBuilder]: For program point L815(lines 815 825) no Hoare annotation was computed. [2022-01-10 00:03:40,345 INFO L858 garLoopResultBuilder]: For program point L815-2(lines 815 825) no Hoare annotation was computed. [2022-01-10 00:03:40,345 INFO L858 garLoopResultBuilder]: For program point L552(lines 552 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,345 INFO L858 garLoopResultBuilder]: For program point L156-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,345 INFO L858 garLoopResultBuilder]: For program point L90-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,345 INFO L858 garLoopResultBuilder]: For program point L1015(lines 1015 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,345 INFO L858 garLoopResultBuilder]: For program point L949(lines 949 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,345 INFO L858 garLoopResultBuilder]: For program point L685(lines 685 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,345 INFO L858 garLoopResultBuilder]: For program point L487(lines 487 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,345 INFO L858 garLoopResultBuilder]: For program point L421(lines 421 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,345 INFO L858 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-01-10 00:03:40,346 INFO L858 garLoopResultBuilder]: For program point L91(line 91) no Hoare annotation was computed. [2022-01-10 00:03:40,346 INFO L858 garLoopResultBuilder]: For program point L950(lines 950 962) no Hoare annotation was computed. [2022-01-10 00:03:40,346 INFO L858 garLoopResultBuilder]: For program point L950-2(lines 950 962) no Hoare annotation was computed. [2022-01-10 00:03:40,346 INFO L858 garLoopResultBuilder]: For program point L488(lines 488 496) no Hoare annotation was computed. [2022-01-10 00:03:40,346 INFO L858 garLoopResultBuilder]: For program point L488-2(lines 488 496) no Hoare annotation was computed. [2022-01-10 00:03:40,346 INFO L858 garLoopResultBuilder]: For program point L356(lines 356 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,346 INFO L858 garLoopResultBuilder]: For program point L290(lines 290 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,346 INFO L858 garLoopResultBuilder]: For program point L224(lines 224 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,346 INFO L858 garLoopResultBuilder]: For program point L753(lines 753 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,346 INFO L858 garLoopResultBuilder]: For program point L159-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,346 INFO L858 garLoopResultBuilder]: For program point L93-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,346 INFO L858 garLoopResultBuilder]: For program point L886(lines 886 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,346 INFO L858 garLoopResultBuilder]: For program point L160(line 160) no Hoare annotation was computed. [2022-01-10 00:03:40,346 INFO L858 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2022-01-10 00:03:40,346 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 00:03:40,347 INFO L858 garLoopResultBuilder]: For program point L162-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,347 INFO L858 garLoopResultBuilder]: For program point L96-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,347 INFO L858 garLoopResultBuilder]: For program point L691(lines 691 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,347 INFO L858 garLoopResultBuilder]: For program point L625(lines 625 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,347 INFO L858 garLoopResultBuilder]: For program point L559(lines 559 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,347 INFO L858 garLoopResultBuilder]: For program point L427(lines 427 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,347 INFO L858 garLoopResultBuilder]: For program point L163(line 163) no Hoare annotation was computed. [2022-01-10 00:03:40,347 INFO L858 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-01-10 00:03:40,347 INFO L858 garLoopResultBuilder]: For program point L1022(lines 1022 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,347 INFO L858 garLoopResultBuilder]: For program point L891(lines 891 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,347 INFO L858 garLoopResultBuilder]: For program point L363(lines 363 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,347 INFO L858 garLoopResultBuilder]: For program point L297(lines 297 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,347 INFO L858 garLoopResultBuilder]: For program point L231(lines 231 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,347 INFO L858 garLoopResultBuilder]: For program point L165-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,347 INFO L858 garLoopResultBuilder]: For program point L99-1(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,348 INFO L858 garLoopResultBuilder]: For program point L33(lines 33 35) no Hoare annotation was computed. [2022-01-10 00:03:40,348 INFO L858 garLoopResultBuilder]: For program point L33-2(lines 32 1036) no Hoare annotation was computed. [2022-01-10 00:03:40,348 INFO L858 garLoopResultBuilder]: For program point L826(lines 826 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,348 INFO L858 garLoopResultBuilder]: For program point L760(lines 760 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,348 INFO L858 garLoopResultBuilder]: For program point L166(line 166) no Hoare annotation was computed. [2022-01-10 00:03:40,348 INFO L858 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2022-01-10 00:03:40,348 INFO L858 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2022-01-10 00:03:40,348 INFO L858 garLoopResultBuilder]: For program point L497(lines 497 1034) no Hoare annotation was computed. [2022-01-10 00:03:40,351 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:03:40,352 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 00:03:40,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:03:40 BoogieIcfgContainer [2022-01-10 00:03:40,370 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 00:03:40,370 INFO L158 Benchmark]: Toolchain (without parser) took 50415.30ms. Allocated memory was 192.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 139.6MB in the beginning and 860.3MB in the end (delta: -720.7MB). Peak memory consumption was 970.5MB. Max. memory is 8.0GB. [2022-01-10 00:03:40,370 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 192.9MB. Free memory is still 159.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 00:03:40,371 INFO L158 Benchmark]: CACSL2BoogieTranslator took 574.97ms. Allocated memory was 192.9MB in the beginning and 242.2MB in the end (delta: 49.3MB). Free memory was 139.4MB in the beginning and 185.9MB in the end (delta: -46.5MB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB. [2022-01-10 00:03:40,371 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.91ms. Allocated memory is still 242.2MB. Free memory was 185.9MB in the beginning and 168.6MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-01-10 00:03:40,371 INFO L158 Benchmark]: Boogie Preprocessor took 118.01ms. Allocated memory is still 242.2MB. Free memory was 168.6MB in the beginning and 159.2MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-01-10 00:03:40,371 INFO L158 Benchmark]: RCFGBuilder took 1360.48ms. Allocated memory is still 242.2MB. Free memory was 159.2MB in the beginning and 174.4MB in the end (delta: -15.2MB). Peak memory consumption was 95.5MB. Max. memory is 8.0GB. [2022-01-10 00:03:40,371 INFO L158 Benchmark]: TraceAbstraction took 48238.79ms. Allocated memory was 242.2MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 173.8MB in the beginning and 860.3MB in the end (delta: -686.4MB). Peak memory consumption was 955.4MB. Max. memory is 8.0GB. [2022-01-10 00:03:40,372 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.11ms. Allocated memory is still 192.9MB. Free memory is still 159.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 574.97ms. Allocated memory was 192.9MB in the beginning and 242.2MB in the end (delta: 49.3MB). Free memory was 139.4MB in the beginning and 185.9MB in the end (delta: -46.5MB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 114.91ms. Allocated memory is still 242.2MB. Free memory was 185.9MB in the beginning and 168.6MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 118.01ms. Allocated memory is still 242.2MB. Free memory was 168.6MB in the beginning and 159.2MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 1360.48ms. Allocated memory is still 242.2MB. Free memory was 159.2MB in the beginning and 174.4MB in the end (delta: -15.2MB). Peak memory consumption was 95.5MB. Max. memory is 8.0GB. * TraceAbstraction took 48238.79ms. Allocated memory was 242.2MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 173.8MB in the beginning and 860.3MB in the end (delta: -686.4MB). Peak memory consumption was 955.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: 148]: 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 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.2s, OverallIterations: 25, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 19.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3946 SdHoareTripleChecker+Valid, 17.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3946 mSDsluCounter, 6173 SdHoareTripleChecker+Invalid, 13.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 688 mSDsCounter, 2512 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16668 IncrementalHoareTripleChecker+Invalid, 19180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2512 mSolverCounterUnsat, 5485 mSDtfsCounter, 16668 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3537 GetRequests, 3473 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20510occurred in iteration=22, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 25 MinimizatonAttempts, 22425 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 217 NumberOfFragments, 547 HoareAnnotationTreeSize, 3 FomulaSimplifications, 11740 FormulaSimplificationTreeSizeReduction, 5.6s HoareSimplificationTime, 3 FomulaSimplificationsInter, 65502 FormulaSimplificationTreeSizeReductionInter, 4.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 14035 NumberOfCodeBlocks, 14035 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 14250 ConstructedInterpolants, 0 QuantifiedInterpolants, 51667 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4203 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 31 InterpolantComputations, 25 PerfectInterpolantSequences, 25747/27304 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: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((a23 / 5 / 5 <= 127750 && a25 == 11) && 141 <= a29) && a4 == 1) || ((a25 == 9 && a4 == 1) && a23 <= 312)) || ((a25 == 11 && a4 == 1) && a23 <= 312)) || (((a25 == 13 && a29 <= 220) && a4 == 1) && a23 <= 312)) || ((((a25 == 12 || a25 == 11) && a23 / 5 / 5 <= 127750) && 28470 + a29 <= 0) && a4 == 1)) || ((a25 == 13 && a4 == 0) && a23 <= 138)) || (((a25 == 13 && a29 <= 245) && 141 <= a29) && a4 == 1)) || ((a25 == 12 && a23 / 5 / 5 <= 127750) && a4 == 0)) || (((a25 == 13 && 261 <= a29) && a4 == 1) && a23 <= 312)) || ((a4 == 0 && a25 == 11) && a23 <= 138)) || (((a25 == 13 && a23 / 5 / 5 <= 127750) && a4 == 1) && !(a23 <= 306))) || ((a25 == 11 && 277 < a29) && a4 == 1)) || ((a25 == 13 && a23 <= 138) && a4 == 1)) || (((a23 / 5 / 5 <= 127750 && a25 <= 10) && 306 < a23) && a4 == 1)) || ((a25 == 12 && a4 == 1) && a23 <= 312)) || ((a25 == 12 && a4 == 0) && a29 + 554036 <= 0)) || ((!(138 < a23) && a25 <= 10) && a4 == 1)) || ((a25 == 12 && a4 == 0) && 141 <= a29)) || ((a23 / 5 / 5 <= 127750 && a4 == 0) && a25 <= 10)) || ((a25 <= 10 && 141 <= a29) && a4 == 1)) || (((a25 == 12 && a23 / 5 / 5 <= 127750) && 141 <= a29) && a4 == 1) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((a23 / 5 / 5 <= 127750 && a25 == 11) && 141 <= a29) && a4 == 1) || ((a25 == 9 && a4 == 1) && a23 <= 312)) || ((a25 == 11 && a4 == 1) && a23 <= 312)) || (((a25 == 13 && a29 <= 220) && a4 == 1) && a23 <= 312)) || ((((a25 == 12 || a25 == 11) && a23 / 5 / 5 <= 127750) && 28470 + a29 <= 0) && a4 == 1)) || ((a25 == 13 && a4 == 0) && a23 <= 138)) || (((a25 == 13 && a29 <= 245) && 141 <= a29) && a4 == 1)) || ((a25 == 12 && a23 / 5 / 5 <= 127750) && a4 == 0)) || (((a25 == 13 && 261 <= a29) && a4 == 1) && a23 <= 312)) || ((a4 == 0 && a25 == 11) && a23 <= 138)) || (((a25 == 13 && a23 / 5 / 5 <= 127750) && a4 == 1) && !(a23 <= 306))) || ((a25 == 11 && 277 < a29) && a4 == 1)) || ((a25 == 13 && a23 <= 138) && a4 == 1)) || (((a23 / 5 / 5 <= 127750 && a25 <= 10) && 306 < a23) && a4 == 1)) || ((a25 == 12 && a4 == 1) && a23 <= 312)) || ((a25 == 12 && a4 == 0) && a29 + 554036 <= 0)) || ((!(138 < a23) && a25 <= 10) && a4 == 1)) || ((a25 == 12 && a4 == 0) && 141 <= a29)) || ((a23 / 5 / 5 <= 127750 && a4 == 0) && a25 <= 10)) || ((a25 <= 10 && 141 <= a29) && a4 == 1)) || (((a25 == 12 && a23 / 5 / 5 <= 127750) && 141 <= a29) && a4 == 1) - InvariantResult [Line: 1038]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-01-10 00:03:40,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...